Skip to main content

Generalising and Unifying SLUR and Unit-Refutation Completeness

  • Conference paper
SOFSEM 2013: Theory and Practice of Computer Science (SOFSEM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7741))

Abstract

The class \(\mathcal{SLUR}\) (Single Lookahead Unit Resolution) was introduced in [22] as an umbrella class for efficient SAT solving.[7,2] extended this class in various ways to hierarchies covering all of CNF (all clause-sets). We introduce a hierarchy \(\mathcal{SLUR}_k\) which we argue is the natural “limit” of such approaches.

The second source for our investigations is the class \(\mathcal{UC}\) of unit-refutation complete clause-sets introduced in [10]. Via the theory of (tree-resolution based) “hardness” of clause-sets as developed in [19,20,1] we obtain a natural generalisation \(\mathcal{UC}_k\), containing those clause-sets which are “unit-refutation complete of level k”, which is the same as having hardness at most k. Utilising the strong connections to (tree-)resolution complexity and (nested) input resolution, we develop fundamental methods for the determination of hardness (the level k in \(\mathcal{UC}_k\)).

A fundamental insight now is that \(\mathcal{SLUR} = \mathcal{UC}_k\) holds for all k. We can thus exploit both streams of intuitions and methods for the investigations of these hierarchies. As an application we can easily show that the hierarchies from [7,2] are strongly subsumed by \(\mathcal{SLUR}_k\). We conclude with a discussion of open problems and future directions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ansótegui, C., Bonet, M.L., Levy, J., Manyà, F.: Measuring the hardness of SAT instances. In: Fox, D., Gomes, C. (eds.) Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 222–228 (2008)

    Google Scholar 

  2. Balyo, T., Gurský, Š., Kučera, P., Vlček, V.: On hierarchies over the SLUR class. In: Twelfth International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012 (2012), http://www.cs.uic.edu/bin/view/Isaim2012/AcceptedPapers

  3. Bessiere, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 412–418 (2009)

    Google Scholar 

  4. Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)

    Google Scholar 

  5. Bordeaux, L., Marques-Silva, J.: Knowledge Compilation with Empowerment. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 612–624. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Čepek, O., Kučera, P.: Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. Discrete Applied Mathematics 149, 14–52 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Čepek, O., Kučera, P., Vlček, V.: Properties of SLUR Formulae. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 177–189. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Crama, Y., Hammer, P.L.: Boolean Functions: Theory, Algorithms, and Applications, LNCS. Encyclopedia of Mathematics and Its Applications, vol. 142. Cambridge University Press (2011)

    Google Scholar 

  9. Darwiche, A., Pipatsrisawat, K.: On the power of clause-learning SAT solvers as resolution engines. Artificial Intelligence 175(2), 512–525 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. del Val, A.: Tractable databases: How to make propositional unit resolution complete through compilation. In: Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR 1994), pp. 551–561 (1994)

    Google Scholar 

  11. Franco, J.: Relative size of certain polynomial time solvable subclasses of satisfiability. In: Du, D., Gu, J., Pardalos, P.M. (eds.) Satisfiability Problem: Theory and Applications (DIMACS Workshop), March 11-13, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, pp. 211–223. American Mathematical Society (1997)

    Google Scholar 

  12. Franco, J., Gelder, A.V.: A perspective on certain polynomial-time solvable classes of satisfiability. Discrete Applied Mathematics 125, 177–214 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gwynne, M., Kullmann, O.: Towards a better understanding of hardness. In: The Seventeenth International Conference on Principles and Practice of Constraint Programming (CP 2011): Doctoral Program Proceedings, pp. 37–42 (2011), http://people.cs.kuleuven.be/~guido.tack/dp2011/DP_at_CP2011.pdf

  14. Gwynne, M., Kullmann, O.: Towards a better understanding of SAT translations. In: Berger, U., Therien, D. (eds.) Logic and Computational Complexity (LCC 2011), as part of LICS 2011 (2011)

    Google Scholar 

  15. Gwynne, M., Kullmann, O.: Generalising unit-refutation completeness and SLUR via nested input resolution. Technical Report arXiv:1204.6529v4 [cs.LO], arXiv (2012)

    Google Scholar 

  16. Henschen, L.J., Wos, L.: Unit refutations and Horn sets. Journal of the Association for Computing Machinery 21(4), 590–605 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  17. Büning, H.K.: On generalized Horn formulas and k-resolution. Theoretical Computer Science 116, 405–413 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  18. Büning, H.K., Kullmann, O.: Minimal unsatisfiability and autarkies. In: Biere, et al. (eds.) [4], ch. 11, pp. 339–401 (2008)

    Google Scholar 

  19. Kullmann, O.: Investigating a general hierarchy of polynomially decidable classes of CNF’s based on short tree-like resolution proofs. Technical Report TR99-041, Electronic Colloquium on Computational Complexity, ECCC (1999)

    Google Scholar 

  20. Kullmann, O.: Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems. Annals of Mathematics and Artificial Intelligence 40(3-4), 303–352 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kullmann, O.: Present and Future of Practical SAT Solving. In: Creignou, N., Kolaitis, P., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 283–319. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Schlipf, J.S., Annexstein, F.S., Franco, J.V., Swaminathan, R.P.: On finding solutions for extended Horn formulas. Information Processing Letters 54, 133–137 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. van Maaren, H.: A short note on some tractable cases of the satisfiability problem. Information and Computation 158(2), 125–130 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gwynne, M., Kullmann, O. (2013). Generalising and Unifying SLUR and Unit-Refutation Completeness. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds) SOFSEM 2013: Theory and Practice of Computer Science. SOFSEM 2013. Lecture Notes in Computer Science, vol 7741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35843-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35843-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35842-5

  • Online ISBN: 978-3-642-35843-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics