53 search results - page 1 / 11 » The Completeness of Propositional Resolution: A Simple and C... |
LMCS
2006
13 years 4 months ago
2006
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
JETAI
2008
13 years 4 months ago
2008
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
APAL
1999
13 years 4 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...
CIE
2010
Springer
13 years 6 months ago
2010
Springer
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the refutation system of Resolution and its generalisations with bounded conjunction, ...
TABLEAUX
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...