827 search results - page 58 / 166 » Proof-Theoretic Soundness and Completeness |
ESOP
2006
Springer
14 years 1 months ago
2006
Springer
We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisim...
AAAI
2007
14 years 11 days ago
2007
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
AIPS
2007
14 years 11 days ago
2007
High-level actions (HLAs) lie at the heart of hierarchical planning. Typically, an HLA admits multiple refinements into primitive action sequences. Correct descriptions of the ef...
AAAI
2006
13 years 11 months ago
2006
For many large systems the computational complexity of complete model-based diagnosis is prohibitive. In this paper we investigate the speedup of the diagnosis process by exploiti...
IJCAI
1989
13 years 11 months ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...