Minimal Distance of Propositional Models

We investigate the complexity of three optimization problems in Boolean propositional logic related to information theory: Given a conjunctive formula over a set of relations, find a satisfying assignment with minimal Hamming distance to a given assignment that satisfies the formula (NearestOtherSolution, NOSol) or that does not need to satisfy it (NearestSolution, NSol). The third problem asks for two satisfying assignments with a minimal Hamming distance among all such assignments (MinSolutionDistance, MSD). For all three problems we give complete classifications with respect to the relations admitted in the formula. We give polynomial time algorithms for several classes of constraint languages. For all other cases we prove hardness or completeness regarding APX, poly-APX, or equivalence to well-known hard optimization problems.

[1]  B. A. Romov.  The algebras of partial functions and their invariants , 1981 .

[2]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[3]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[4]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[5]  Henning Schnoor,et al.  Nonuniform Boolean constraint satisfaction problems with cardinality constraint , 2010, TOCL.

[6]  Heribert Vollmer,et al.  Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar] , 2008, Complexity of Constraints.

[7]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

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

[9]  Gernot Salzer,et al.  As Close as It Gets , 2016, WALCOM.

[10]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[11]  D. Lau,et al.  Function algebras on finite sets : a basic course on many-valued logic and clone theory , 2006 .

[12]  Gianluca Rossi,et al.  On the Hamming distance of constraint satisfaction problems , 2002, Theor. Comput. Sci..

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

[14]  Heribert Vollmer,et al.  Playing with Boolean Blocks , Part II : Constraint Satisfaction Problems 1 , 2004 .

[15]  Reinhard Pöschel,et al.  Funktionen- und Relationenalgebren , 1979 .

[16]  Gustav Nordh,et al.  Trichotomies in the Complexity of Minimal Inference , 2012, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[17]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[18]  Ilka Schnoor.  The weak base method for constraint satisfaction , 2008 .

[19]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[20]  Pierre Marquis,et al.  Some Computational Aspects of distance-sat , 2006, Journal of Automated Reasoning.

[21]  K. A. Baker,et al.  Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems , 1975 .

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

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

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

[25]  Alexander Vardy,et al.  The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.

[26]  Bruno Zanuttini,et al.  An efficient algorithm for Horn description , 2003, Inf. Process. Lett..

[27]  Victor Lagerkvist.  Weak bases of Boolean co-clones , 2014, Inf. Process. Lett..

[28]  Madhu Sudan,et al.  Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.

[29]  Viggo Kann,et al.  Polynomially Bounded Minimization Problems That Are Hard to Approximate , 1993, Nord. J. Comput..

[30]  Jacques Stern,et al.  The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..

[31]  Heribert Vollmer,et al.  Bases for Boolean co-clones , 2005, Inf. Process. Lett..

[32]  Mukesh Dalal,et al.  Investigations into a Theory of Knowledge Base Revision , 1988, AAAI.

[33]  Gernot Salzer,et al.  Give Me Another One! , 2015, ISAAC.

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

[35]  Joseph Naor,et al.  Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality , 1993, Math. Program..

[36]  Gernot Salzer,et al.  The Next Whisky Bar , 2016, CSR.

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