The complexity of propositional implication

Authors:
Olaf Beyersdorff;Arne Meier;Michael Thomas;Heribert Vollmer
Affiliations:
Institut für Theoretische Informatik, Gottfried Wilhelm Leibniz Universität, Appelstr. 4, 30167 Hannover, Germany;Institut für Theoretische Informatik, Gottfried Wilhelm Leibniz Universität, Appelstr. 4, 30167 Hannover, Germany;Institut für Theoretische Informatik, Gottfried Wilhelm Leibniz Universität, Appelstr. 4, 30167 Hannover, Germany;Institut für Theoretische Informatik, Gottfried Wilhelm Leibniz Universität, Appelstr. 4, 30167 Hannover, Germany
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 7

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
The Complexity of Satisfiability for Fragments of CTL and CTL*;

Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of generalized satisfiability for linear temporal logic

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures

Sets of boolean connectives that make argumentation easier

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Generalized satisfiability for the description logic ALC

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The Complexity of Reasoning for Fragments of Autoepistemic Logic

ACM Transactions on Computational Logic (TOCL)
On the applicability of Post's lattice

Information Processing Letters
On the parameterized complexity of default logic and autoepistemic logic

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Lewis Dichotomies in Many-Valued Logics

Studia Logica
Generalized satisfiability for the description logic ALC

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

The question whether a set of formulae @C implies a formula @f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean connectives. We give a complete complexity-theoretic classification for all sets of Boolean functions in the meaning of Post's lattice and show that the implication problem is efficiently solvable only if the connectives are definable using the constants {0,1} and only one of {@?,@?,@?}. The problem remains coNP-complete in all other cases. We also consider the restriction of @C to singletons which makes the problem strictly easier in some cases.