827 search results - page 22 / 166 » Proof-Theoretic Soundness and Completeness |
APAL
1999
14 years 9 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
VL
2007
IEEE
15 years 4 months ago
2007
IEEE
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
FQAS
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. With more and more electronic information sources becoming widely available, the issue of the quality of these often-competing sources has become germane. We propose a st...
TABLEAUX
1997
Springer
15 years 1 months ago
1997
Springer
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
100
click to vote
FMOODS
2003
14 years 11 months ago
2003
This paper outlines a sound and complete Hoare logic for a sequential object-oriented language with inheritance and subtyping like Java. It describes a weakest precondition calculu...