Over the last ten years, argumentation has come to be increasingly central as a core study
within Artificial Intelligence (AI). The articles forming this volume reflect a variety of important …

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 …

Propositional proof complexity is the study of the sizes of propositional proofs, and more
generally, the resources necessary to certify propositional tautologies. Questions about …

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 …

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 …

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 …

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 …

Proof complexity (tacitly propositional) has a number of facets linking it with mathematical
logic, computational complexity theory, automated proof search and SAT algorithms and …