A New Algorithm for the Propositional Satisfiability Problem

A new enumeration algorithm is proposed for the propositional satisfiability problem. Such algorithm is based on a hypergraph formulation of the problem. Two different implementations of the algorithm are presented together with the results of an experimentation intended to compare their performance with the performance of other known methods. The computational results obtained are quite promising.

[1]  D. J. Hand,et al.  Artificial intelligence , 1981, Psychological Medicine.

[2]  Gerald L. Thompson,et al.  A Computational Study of Satisfiability Algorithms for Propositional Logic , 1994, INFORMS J. Comput..

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

[4]  John Franco,et al.  Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem , 1983, Discret. Appl. Math..

[5]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[6]  John V. Franco,et al.  On the Probabilistic Performance of Algorithms for the Satisfiability Problem , 1986, Inf. Process. Lett..

[7]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[8]  David J. Evans,et al.  An Improved Bisection Algorithm , 1979, Inf. Process. Lett..

[9]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[10]  Bengt Aspvall,et al.  Recognizing Disguised NR(1) Instances of the Satisfiability Problem , 1980, J. Algorithms.

[11]  Maria Grazia Scutellà,et al.  Polynomially Solvable Satisfiability Problems , 1988, Inf. Process. Lett..

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

[13]  John N. Hooker,et al.  Extended Horn sets in propositional logic , 1991, JACM.

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

[15]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[16]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[17]  Ewald Speckenmeyer,et al.  Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..