105 search results - page 3 / 21 » Optimal Proof Systems for Propositional Logic and Complete S... |
FSS
2006
13 years 7 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
ENTCS
2006
13 years 7 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
AML
2006
13 years 7 months ago
2006
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
TPHOL
2005
IEEE
14 years 29 days ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...