Skip to main content

Unit Propagation in a Tableau Framework

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3702))

  • 384 Accesses

Abstract

Unit propagation is one of the most important techniques of efficient SAT solvers. Unfortunately, this technique is not directly applicable to first-order clausal tableaux. We show a way of integrating a variant of unit propagation into the disconnection calculus and present some results obtained with an implementation of unit propagation in the DCTP theorem prover that show the usefulness of our new method.

This work was partially funded by the German Federal Ministry of Education, Science, Research and Technology (BMBF) in the framework of the Verisoft project under grant 01 IS C38. The responsibility for this article lies with the author(s).

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. Baumgartner, P., Tinelli, C.: The Model Evolution Calculus. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 350–364. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the Association for Computing Machinery, 394–397 (1962)

    Google Scholar 

  3. Letz, R., Stenz, G.: Proof and Model Generation with Disconnection Tableaux. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 142–156. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Massacci, F.: Simplification: A general constraint propagation technique for propositional and modal tableaux. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 217–231. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Schulz, S.: System Abstract: E 0.61. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 370–375. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Stenz, G.: DCTP 1.2 – System Abstract. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 335–340. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Stenz, G.: The Disconnection Calculus. Logos Verlag, Berlin (2002), Dissertation, Fakultät für Informatik, Technische Universität München

    Google Scholar 

  8. Zhang, H., Stickel, M.E.: An efficient algorithm for unit propagation. In: Proceedings, AI-MATH 1996 (December 1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stenz, G. (2005). Unit Propagation in a Tableau Framework. In: Beckert, B. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2005. Lecture Notes in Computer Science(), vol 3702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554554_29

Download citation

  • DOI: https://doi.org/10.1007/11554554_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28931-9

  • Online ISBN: 978-3-540-31822-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics