Skip to main content
SpringerLink
Log in

About some UP-based polynomial fragments of SAT

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

This paper explores several polynomial fragments of SAT that are based on the unit propagation (UP) mechanism. As a first case study, one Tovey’s polynomial fragment of SAT is extended through the use of UP. Then, we answer an open question about connections between the so-called UP-Horn class (and other UP-based polynomial variants) and Dalal’s polynomial Quad class. Finally, we introduce an extended UP-based pre-processing procedure that allows us to prove that some series of benchmarks from the SAT competitions are polynomial ones. Moreover, our experimentations show that this pre-processing can speed-up the satisfiability check of other instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Boros, E., Hammer, P.L., Sun, X.: Recognition of q-Horn formulae in linear time. Ann. Math. Artif. Intell. 1, 21–32 (1990)

    Article  MATH  Google Scholar 

  2. Boros, E., Hammer, P.L., Sun, X.: Polynomial-time inference of all valid implications for Horn and related formulae. Discret. Appl. Math. 55(1), 1–13 (1994)

    Article  Google Scholar 

  3. Cepek, O., Kucera, P.: Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. Discret. Appl. Math. 149(1–3), 14–52 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cepek, O., Kucera, P., Vlcek, V.: Properties of SLUR formulae. In: Proceedings of the 38th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Lect. Notes Comput. Sci, vol. 7147, pp. 177–189. Springer (2012)

  5. Chandru, V., Hooker, J.N.: Extended Horn sets in propositional logic. J. ACM 38(1), 205–221 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Conforti, M., Cornuéjols, G., Vuskovic, K.: Balanced matrices. Discret. Math. 306(19–20), 2411–2437 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp 151–158 (1971)

  8. Crama, Y., Hammer, P.L.: Boolean functions - Theory, Algorithms, and Applications, Encyclopedia of mathematics and its applications, vol. 142. Cambridge University Press, Cambridge (2011)

    Book  Google Scholar 

  9. Dalal, M.: An almost quadratic class of satisfiability problems. In: Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI’96), pp 355–359. Wiley, New York (1996)

  10. Dalal, M., Etherington, D.W.: A hierarchy of tractable satisfiability problems. Inf. Process. Lett. 44(4), 173–180 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Darras, S., Dequen, G., Devendeville, L., Mazure, B., Ostrowski, R., Saïs, L.: Using boolean constraint propagation for sub-clauses deduction. In: Proceedings of the Eleventh International Conference on Principles and Practice of Constraint Programming (CP’05), Lect. Notes Comput. Sci., vol. 3709, pp 757–761. Springer, Berlin Heidelberg (2005)

  12. DIMACS: Second challenge on satisfiability testing. http://dimacs.rutgers.edu/Challenges/ (1993)

  13. Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing satisfiability of propositional Horn formulae. J. Log. Lang. Inf., 267–284 (1984)

  14. Dubois, O., André, P., Boufkhad, Y., Carlier, Y.: Second DIMACS implementation challenge: cliques, coloring and satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, chap. SAT vs. UNSAT, pp. 415–436. American Mathematical Society (1996)

  15. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT’03), pp 502–518 (2003)

  16. Fourdrinoy, O.: Utilisation de techniques polynomiales pour la résolution pratique de sat. Thèse de doctorat, Université d’Artois. Lens, France (2007). (in french)

  17. Fourdrinoy, O., Grégoire, É., Mazure, B., Saïs, L.: Eliminating redundant clauses in SAT instances. In: Proceedings of the The Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR’07), Lect. Notes Earth Sci., vol. 4510, pp 71–83. Springer, Berlin Heidelberg (2007)

  18. Fourdrinoy, O., Grégoire, É., Mazure, B., Saïs, L.: Reducing hard SAT instances to polynomial ones. In: Proceedings of the IEEE International Conference on Information Reuse and Integration (IRI 2007), pp 18–23 (2007)

  19. Franco, J., Gelder, A.V.: A perspective on certain polynomial-time solvable classes of satisfiability. J. Discret. Appl. Math. 125, 177–214 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Gallo, G., Urbani, G.: Algorithms for testing the satisfiability of propositional formulae. J. Log. Program. 7(1), 45–61 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  21. Grégoire, É., Ostrowski, R., Mazure, B., Saïs, L.: Automatic extraction of functional dependencies. In: Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT’04), Lect. Notes Comput. Sci., vol. 3542, pp 122–132. Springer, Berlin Heidelberg (2004)

  22. Henschen, L., Wos, L.: Unit refutations and Horn sets. J. ACM 21(4), 590–605 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  23. Heule, M., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: Guiding CDCL SAT solvers by lookaheads. In: Proceedings of the Seventh International Haifa Verification Conference (HVC 2011), Revised Selected Papers, Lect. Notes Comput. Sci., vol. 7261, pp 50–65. Springer, Berlin Heidelberg (2011)

  24. Kaufmann, M., Kottler, S.: Beyond unit propagation in SAT solving. In: Proceedings of the Tenth International Symposium on Experimental Algorithms (SEA 2011), Lect. Notes Comput. Sci., vol. 6630, pp 267–279. Springer, Berlin Heidelberg (2011)

  25. Le Berre, D.: Exploiting the real power of unit propagation lookahead. Electron Notes Discrete Math. 9, 59–80 (2001)

    Article  MATH  Google Scholar 

  26. Lewis, H.R.: Renaming a set of clauses as a Horn set. J. ACM 25, 134–135 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  27. Li, C.M.: Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI’97), vol. 366–371 (1997)

  28. Li, C.M., Manyà, F., Planes, J.: New inference rules for Max-SAT. J. Artif. Intell. Res. (JAIR) 30(1), 321–359 (2007)

    MathSciNet  MATH  Google Scholar 

  29. Minoux, M.: LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementation. Inf. Process. Lett. 29(1), 1–12 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  30. Ostrowski, R., Mazure, B., Saïs, L., Grégoire, É.: Eliminating redundancies in SAT search trees. In: Proceedings of the Fifteenth IEEE International Conference on Tools with Artificial Intelligence (ICTAI’2003), pp 100–104 (2003)

  31. Pretolani, D.: A linear time algorithm for unique Horn satisfiability. Inf. Process. Lett. 48(2), 61–66 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  32. Rauzy, A.: Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam’s procedure?. In: Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP ’95), Lect. Notes Comput. Sci., vol. 976, pp 515–532. Springer, Berlin Heidelberg (1995)

  33. SAT-Competition: http://www.satcompetition.org/ (2013)

  34. Scutellá, M.G.: A note on Dowling and Gallier’s top-down algorithm for propositional Horn satisfiability. J. Log. Program. 8(3), 265–273 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  35. Tovey, C.A.: A simplified NP-complete satisfiability problem. In: Discret. Appl. Math., vol. 8, pp 85–89 (1984)

  36. Vlcek, V., Balyo, T., Gurskẏ, S., Kucera, P.: On hierarchies over the SLUR class. In: International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012) (on-line proceedings http://www.cs.uic.edu/bin/view/Isaim2012/AcceptedPapers) (2012)

Download references

Author information

Authors and Affiliations

  1. University of Mustansiriyah, Baghdad, Iraq

    Balasim Al-Saedi

  2. CRIL, CNRS, Université d’Artois, rue Jean Souvraz SP18, F-62307, Lens, France

    Balasim Al-Saedi, Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure & Lakhdar Saïs

  3. Capgemini, 165 Avenue de Bretagne, F-59000, Lille, France

    Olivier Fourdrinoy

Authors
  1. Balasim Al-Saedi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olivier Fourdrinoy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Éric Grégoire
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bertrand Mazure
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lakhdar Saïs
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bertrand Mazure.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Al-Saedi, B., Fourdrinoy, O., Grégoire, É. et al. About some UP-based polynomial fragments of SAT. Ann Math Artif Intell 79, 25–44 (2017). https://doi.org/10.1007/s10472-015-9452-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-015-9452-z

Keywords

Mathematics Subject Classification (2010)

Search

Navigation