9 search results - page 1 / 2 » The Limits of Tractability in Resolution-Based Propositional... |
CIE
2010
Springer
14 years 13 days 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, ...
AML
2006
13 years 11 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...
IJCAI
2007
14 years 8 days ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
ECCC
2007
13 years 10 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
RTA
2010
Springer
14 years 2 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...