论文信息 - On 2-SAT and Renamable Horn

On 2-SAT and Renamable Horn

We introduce new linear time algorithms for satisability of binary propositional theories (2-SAT), and for recognition and satisability of renamable Horn theories. The algorithms are based on unit resolution, and are thus likely easier to integrate within general SAT solvers than other graph-based algorithms.

Alvaro del Val

[1] Kenneth D. Forbus,et al. Building Problem Solvers , 1993 .

[2] Harry R. Lewis,et al. Renaming a Set of Clauses as a Horn Set , 1978, JACM.

[3] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

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

[5] Lawrence J. Henschen,et al. Unit Refutations and Horn Sets , 1974, JACM.

[6] Mukesh Dalal,et al. A Hierarchy of Tractable Satisfiability Problems , 1992, Inf. Process. Lett..

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

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

[9] Tracy Larrabee,et al. Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.