PE Dunne - Artificial Intelligence, 2007 - Elsevier
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been …
Although reasoning about what is the case has been the historic focus of logic, reasoning about what should be done is an equally important capacity for an intelligent agent …
N Segerlind - Bulletin of symbolic Logic, 2007 - cambridge.org
Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about …
H Kautz, B Selman - Discrete Applied Mathematics, 2007 - Elsevier
The state of SAT - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search ScienceDirect Elsevier …
M Alekhnovich, J Johannsen, T Pitassi… - Theory of …, 2007 - theoryofcomputing.org
An Exponential Separation between Regular and General Resolution Page 1 Theory OF Computing, Volume 3 (2007), pp. 81–102 http://theoryofcomputing.org An Exponential …
Publisher Summary This chapter examines computational approaches to modal logics. A variety of computational approaches and reasoning problems are considered, the use of …
C Glaßer, AL Selman, L Zhang - Theoretical Computer Science, 2007 - Elsevier
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree …
O Beyersdorff - Theoretical Computer Science, 2007 - Elsevier
For a propositional proof system P we introduce the complexity class DNPP (P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P …
J Krajıcek - Proc. from the 13th International Congress of Logic …, 2007 - karlin.mff.cuni.cz
Proof complexity (tacitly propositional) has a number of facets linking it with mathematical logic, computational complexity theory, automated proof search and SAT algorithms and …