Minimization for Generalized Boolean Formulas

The minimization problem for propositional formulas is an important optimization problem in the second level of the polynomial hierarchy. In general, the problem is Σ2p-complete under Turing reductions, but restricted versions are tractable. We study the complexity of minimization for formulas in two established frameworks for restricted propositional logic: The Post framework allowing arbitrarily nested formulas over a set of Boolean connectors, and the constraint setting, allowing generalizations of CNF formulas. In the Post case, we obtain a dichotomy result: Minimization is solvable in polynomial time or coNP-hard. This result also applies to Boolean circuits. For CNF formulas, we obtain new minimization algorithms for a large class of formulas, and give strong evidence that we have covered all polynomial-time cases.

[1]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[2]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[3]  Phokion G. Kolaitis,et al.  Structure identification of Boolean relations and plain bases for co-clones , 2008, J. Comput. Syst. Sci..

[4]  François Goasdoué,et al.  Distributed Reasoning in a Peer-to-Peer Setting , 2004, ECAI.

[5]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[6]  Christopher Umans.  The minimum equivalent DNF problem and shortest implicants , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[7]  Heribert Vollmer,et al.  Complexity of non-monotonic logics , 2010, Bull. EATCS.

[8]  Guilherme Bittencourt.  Combining Syntax and Semantics through Prime Form Representation , 2008, J. Log. Comput..

[9]  Numérisation de documents anciens mathématiques.  Informatique théorique et applications : Theoretical informatics and applications. , 1986 .

[10]  C. Curtis.  Linear Algebra: An Introductory Approach , 1984 .

[11]  Tiziano Villa,et al.  Complexity of two-level logic minimization , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Edith Hemaspaandra,et al.  The minimization problem for Boolean formulas , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[13]  Gustav Nordh,et al.  An algebraic approach to the complexity of propositional circumscription , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[14]  Peter L. Hammer,et al.  Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression , 1995, IEEE Trans. Knowl. Data Eng..

[15]  Laurent Juban,et al.  Dichotomy Theorem for the Generalized Unique Satisfiability Problem , 1999, FCT.

[16]  Andrei A. Bulatov,et al.  Recent Results on the Algebraic Approach to the CSP , 2008, Complexity of Constraints.

[17]  Nadia Creignou,et al.  On Generating All Solutions of Generalized Satisfiability Problems , 1997, RAIRO Theor. Informatics Appl..

[18]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[19]  David Buchfuhrer,et al.  The complexity of Boolean formula minimization , 2008, J. Comput. Syst. Sci..

[20]  Alfred V. Aho,et al.  The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..

[21]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[22]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[23]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[24]  Tom Chang,et al.  Horn formula minimization , 2006 .

[25]  Harry R. Lewis,et al.  Satisfiability problems for propositional calculi , 1979, Mathematical systems theory.

[26]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[27]  Neil Immerman,et al.  The complexity of satisfiability problems: Refining Schaefer's theorem , 2009, J. Comput. Syst. Sci..

[28]  Edith Hemaspaandra,et al.  Generalized modal satisfiability , 2010, J. Comput. Syst. Sci..

[29]  Steffen Reith.  Generalized satisfiability problems , 2001 .

[30]  Heribert Vollmer,et al.  Equivalence and Isomorphism for Boolean Constraint Satisfaction , 2002, CSL.

[31]  Heribert Vollmer,et al.  The Complexity of Boolean Constraint Isomorphism , 2003, STACS.

[32]  Heribert Vollmer,et al.  Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help? , 2008, Complexity of Constraints.

[33]  Henning Schnoor,et al.  Partial Polymorphisms and Constraint Satisfaction Problems , 2008, Complexity of Constraints.

[34]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.