Sciweavers

247 search results - page 26 / 50
» A Computational Structure for the Propositional Calculus
Sort
View
AIPS
2009
15 years 5 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
LICS
2009
IEEE
15 years 10 months ago
Substructural Operational Semantics as Ordered Logic Programming
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...
Frank Pfenning, Robert J. Simmons
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
15 years 5 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
FORTE
2009
15 years 1 months ago
The Orc Programming Language
Orc was originally presented as a process calculus. It has now evolved into a full programming language, which we describe in this paper. The language has the structure and feel of...
David Kitchin, Adrian Quark, William R. Cook, Jaya...
CSL
2010
Springer
15 years 5 months ago
Quantified Differential Dynamic Logic for Distributed Hybrid Systems
Abstract. We address a fundamental mismatch between the combinations of dynamics that occur in complex physical systems and the limited kinds of dynamics supported in analysis. Mod...
André Platzer