Sciweavers

72 search results - page 10 / 15
» Computational and Information-Theoretic Soundness and Comple...
Sort
View
FMCAD
2004
Springer
14 years 24 days ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl
JLP
2000
140views more  JLP 2000»
13 years 7 months ago
An abductive event calculus planner
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
ICLP
2010
Springer
13 years 6 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
LDTA
2010
13 years 7 months ago
Embedding a web-based workflow management system in a functional language
Workflow management systems guide and monitor tasks performed by humans and computers. The workflow specifications are usually expressed in special purpose (graphical) formalisms....
Jan Martin Jansen, Rinus Plasmeijer, Pieter W. M. ...
POPL
2000
ACM
13 years 11 months ago
Type Systems for Distributed Data Structures
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
Ben Liblit, Alexander Aiken