A modular reduction of regular logic to classical logic

In this paper we first define a reduction /spl delta/ that transforms an instance /spl Gamma/ of Regular-SAT into a satisfiability equivalent instance /spl Gamma//sup /spl delta// of SAT. The reduction /spl delta/ has interesting properties: (i) the size of /spl Gamma//sup /spl delta// is linear in the size of /spl Gamma/, (ii) /spl delta/ transforms regular Horn formulas into Horn formulas, and (iii) /spl delta/ transforms regular 2-CNF formulas into 2-CNF formulas. Second, we describe a new satisfiability algorithm that determines the satisfiability of a regular 2-CNF formula /spl Gamma/ in time O(|/spl Gamma/|log|/spl Gamma/|); this algorithm is inspired by the reduction /spl delta/. Third, we introduce the concept of renamable-Horn regular CNF formula and define another reduction /spl delta/' that transforms a renamable-Horn instance /spl Gamma/ of Regular-SAT into a renamable-Horn instance /spl Gamma//sup /spl delta/'/ of SAT. We use this reduction to show that both membership and satisfiability of renamable-Horn regular CNF formulas can be decided in time O(|/spl Gamma/|log|/spl Gamma/|).

[1]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[2]  Jon T. Butler,et al.  Multiple-valued logic , 1995 .

[3]  Endre Boros,et al.  Recognition of q-Horn Formulae in Linear Time , 1994, Discret. Appl. Math..

[4]  Felip Manyà Serres.  Proof procedures for multiple-valued propositional logics , 1997 .

[5]  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).

[6]  G. Escalada-Imaz,et al.  The satisfiability problem in regular CNF-formulas , 1998, Soft Comput..

[7]  R. Torres,et al.  Systematic and local search algorithms for regular-SAT , 2001 .

[8]  G. Escalada-Imaz,et al.  The satisfiability problem in multiple-valued Horn formulae , 1994, Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94).

[9]  Ramón Béjar,et al.  Solving Combinatorial Problems with Regular Local Search Algorithms , 1999, LPAR.

[10]  Ramón Béjar,et al.  A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas , 1999, ESCQARU.

[11]  Ramón Béjar,et al.  Phase Transitions in the Regular Random 3-SAT Problem , 1999, ISMIS.

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

[13]  Reiner Hähnle.  Exploiting Data Dependencies in Many-Valued Logics , 1996, J. Appl. Non Class. Logics.

[14]  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).

[15]  Reiner Hähnle,et al.  The SAT problem of signed CNF formulas , 2000 .

[16]  Hans Jürgen Ohlbach,et al.  Translation Methods for Non-Classical Logics: An Overview , 1993, Log. J. IGPL.

[17]  Harald Ganzinger,et al.  Chaining techniques for automated theorem proving in many-valued logics , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[18]  E. T. S. Informática.  On 2-SAT and Renamable Horn , 2000 .

[19]  Viorica Sofronie-Stokkermans.  On Translation of Finitely-Valued Logics to Classical First-Order Logic , 1998, ECAI.

[20]  Giorgio Gallo,et al.  Algorithms for Testing the Satisfiability of Propositional Formulae , 1989, J. Log. Program..