Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics

Signed logic is a way of expressing the semantics of many-valued connectives and quantifiers in a formalism that is well-suited for automated reasoning. In this paper we consider propositional, finitely-valued formulas in clausal normal form. We show that checking the satisfiability of formulas with three or more literals per clause is either NP-complete or trivial, depending on whether the intersection of all signs is empty or not. The satisfiability of bijunctive formulas, i.e., formulas with at most two literals per clause, is decidable in linear time if the signs form a Helly family, and is NP-complete otherwise. We present a polynomial-time algorithm for deciding whether a given set of signs satisfies the Helly property. Our results unify and extend previous results obtained for particular sets of signs.

[1]  Reiner Hähnle,et al.  A modular reduction of regular logic to classical logic , 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.

[2]  Carlos Ansótegui,et al.  New logical and complexity results for Signed-SAT , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..

[3]  Bernhard Beckert,et al.  The 2-SAT problem of regular signed CNF formulas , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[4]  Christian G. Fermüller,et al.  Automated Deduction for Many-Valued Logics , 2001, Handbook of Automated Reasoning.

[5]  G. Salzer,et al.  Helly Property and Satisfiability of Boolean Formulas Defined on Set Systems , 2007 .

[6]  Reiner Hähnle,et al.  Automated deduction in multiple-valued logics , 1993, International series of monographs on computer science.

[7]  Christian G. Fermüller,et al.  Resolution-Based Theorem Proving for Manyvalued Logics , 1995, J. Symb. Comput..

[8]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[9]  Witold Charatonik,et al.  2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices , 2007, 37th International Symposium on Multiple-Valued Logic (ISMVL'07).

[10]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[11]  Bernhard Beckert,et al.  Transformations between signed and classical clause logic , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).

[12]  Neil V. Murray,et al.  Signed formulas and annotated logics , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

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