Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model

  • Gábor Kusper
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4314)

Abstract

We report a polynomial time SAT problem instance, the Blocked SAT problem. A blocked clause set, an instance of the Blocked SAT problem, contains only blocked clauses. A close is blocked (for resolution) if it has a literal on which no resolution is possible in the clause set. We know from work of O. Kullmann that a blocked clause can be added or deleted from a clause set without changing its satisfiability. Hence, any blocked clause set is satisfiable, but it is not clear how to find a satisfying assignment for it. We introduce the Blocked SAT Solver algorithm, which provides a model for Blocked SAT problems in linear time, if we know at least one blocked literal per clause. To collect these information polynomial time is needed in general. We show that in case of 3-SAT we can collect these information in linear time. This means that the Blocked 3-SAT problem is a linear time problem. We also discuss how to use blocked clauses if the whole clause set is not blocked.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [APT79]
    Aspvall, B., Plass, M.F., Tarjan, R.E.: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Information Processing Letters 8(3), 121–132 (1979)MATHCrossRefMathSciNetGoogle Scholar
  2. [Asp80]
    Aspvall, B.: Recognizing Disguised NR(1) Instances of the Satisfiability Problem. J. of Algorithms 1, 97–103 (1980)MATHCrossRefMathSciNetGoogle Scholar
  3. [BHS94]
    Boros, E., Hammer, P.L., Sun, X.: Recognition of q-Horn Formulae in Linear Time. Discrete Applied Mathematics 55, 1–13 (1994)MATHCrossRefMathSciNetGoogle Scholar
  4. [BCH+94]
    Boros, E., et al.: A Complexity Index for Satisfiability Problems. SIAM J. on Computing 23, 45–49 (1994)MATHCrossRefMathSciNetGoogle Scholar
  5. [CH91]
    Chandru, V., Hooker, J.: Extended Horn Sets in Propositional Logic. J. of the ACM 38(1), 205–221 (1991)MATHCrossRefMathSciNetGoogle Scholar
  6. [Coo71]
    Cook, S.A.: The Complexity of Theorem-Proving Procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, pp. 151–158 (1971)Google Scholar
  7. [DE92]
    Dalal, M., Etherington, D.W.: A Hierarchy of Tractable Satisfiability Problems. Information Processing Letters 44, 173–180 (1992)MATHCrossRefMathSciNetGoogle Scholar
  8. [DG84]
    Dowling, W.F., Gallier, J.H.: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. of Logic Programming 1(3), 267–284 (1984)CrossRefMathSciNetMATHGoogle Scholar
  9. [EIS76]
    Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multi-Commodity Flow Problems. SIAM J. on Computing 5(4), 691–703 (1976)MATHCrossRefMathSciNetGoogle Scholar
  10. [Knu90]
    Knuth, D.E.: Nested Satisfiability. Acta Informatica 28, 1–6 (1990)MATHMathSciNetCrossRefGoogle Scholar
  11. [Kul99a]
    Kullmann, O.: New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science 223(1-2), 1–72 (1999)MATHCrossRefMathSciNetGoogle Scholar
  12. [Kul99b]
    Kullmann, O.: On a Generalization of Extended Resolution. Discrete Applied Mathematics 97(1-3), 149–176 (1999)CrossRefMathSciNetGoogle Scholar
  13. [Kus02]
    Kusper, G.: Solving the SAT Problem by Hyper-Unit Propagation. RISC Technical Report 02-02, 1–18, University Linz, Austria (2002)Google Scholar
  14. [Kus05]
    Kusper, G.: Solving the Resolution-Free SAT Problem by Hyper-Unit Propagation in Linear Time. Annals of Mathematics and Artificial Intelligence 43(1-4), 129–136 (2005)MATHCrossRefMathSciNetGoogle Scholar
  15. [Lew78]
    Lewis, H.R.: Renaming a set of clauses as a Horn set. J. of the Association for Computing Machinery 25, 134–135 (1978)MATHGoogle Scholar
  16. [LS87]
    Loeckx, J., Sieber, K.: The Foundations of Program Verification, 2nd edn. Wiley, Chichester (1987)MATHGoogle Scholar
  17. [SAF+95]
    Schlipf, J.S., et al.: On finding solutions for extended Horn formulas. Information Processing Letters 54, 133–137 (1995)MATHCrossRefMathSciNetGoogle Scholar
  18. [Scu90]
    Scutella, M.G.: A Note on Dowling and Gallier’s Top-Down Algorithm for Propositional Horn Satisfiability. J. of Logic Programming 8(3), 265–273 (1990)CrossRefMathSciNetMATHGoogle Scholar
  19. [Tov84]
    Tovey, C.A.: A Simplified NP-complete Satisfiability Problem. Discrete Applied Mathematics 8, 85–89 (1984)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Gábor Kusper
    • 1
  1. 1.Eszterházy Károly College, Department of Information Technology, 1. sqr. Eszterházy , Eger 3300Hungary

Personalised recommendations