Skip to main content
SpringerLink
Log in

Conditional Pure Literal Graphs

  • Conference paper
  • First Online:
Book cover Automated Reasoning (IJCAR 2001)

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

Included in the following conference series:

  • 747 Accesses

Abstract

Conditional Pure Literal Graphs (CPLG) characterize the set of models of a propositional formula and are introduced to help understand connections among formulas, models and autarkies. They have been applied to the SAT problem within the framework of refutation- based algorithms. Experimental results and comparisons show that the use of CPLGs is a promising direction towards efficient propositional SAT solvers based upon model elimination. In addition, they open a new perspective on hybrid search/resolution schemes.

Acknowledgements

This work is partly supported by ASI funds and by MURST-COFIN funds (MOSES project). We thank Prof. Fabio Massacci for helpful discussions, and Prof. Luigia Carlucci Aiello for many hours of invaluable help, for advices and comments on preliminary versions of this paper and for believing in me.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. O. L. Astrachan. Meteor: Exploring model elimination theorem proving. JAR, 13:283–296, 1994.

    Article  Google Scholar 

  2. O. L. Astrachan and D. W. Loveland. The use of lemmas in the model elimination procedure. JAR, 19:117–141, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  3. O. L. Astrachan and M. E. Stickel. Caching and lemmatizing in model elimination theorem provers. In Proceedings of CADE-92, pages 224–238, 1992.

    Google Scholar 

  4. R. Bayardo and R. Schrag. Using CSP look-back techniques to solve real-world SAT instances. Proceedings of AAAI97, 1997.

    Google Scholar 

  5. M. Benedetti. Conditional Pure Literal Graphs. Technical Report 18-00, Dipartimento Informatica e Sistemistica, Universitè di Roma “La Sapienza”, ftp://ftp.dis.uniroma1.it/PUB/benedett/sat/techrep-18-00.ps.gz, 2000.

    MATH  Google Scholar 

  6. D. Le Berre. Sat live! page: a dynamic collection of links on sat-related research. http://www.satlive.org, 2000.

  7. M. P. Bonacina and J. Hsiang. On semantic resolution with lemmaizing and contraction and a formal treatment of caching. NGC, 16(2):163–200, 1998.

    Article  MathSciNet  Google Scholar 

  8. S. Cook and D. Mitchell. Finding hard instances of the satisfiability problem: A survey. In Proceedings of the DIMACS Workshop on Satisfiability Problems, 1997.

    Google Scholar 

  9. J.W. Freeman. Improvements to Propositional Satisfiability Search Algorithms. PhD thesis, The University of Pennsylvania, 1995.

    Google Scholar 

  10. A. Van Gelder. Simultaneous construction of refutations and models for Propositional formulas. Technical Report UCSC-CRL-95-61, UCSC, 1995.

    Google Scholar 

  11. A. Van Gelder. Complexity analysis of propositional resolution with autarky pruning. Technical Report UCSC-CRL-96, UC Santa Cruz, 1996.

    Google Scholar 

  12. A. Van Gelder. Autarky pruning in propositional model elimination reduces failure redundancy. JAR, 23:137–193, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  13. A. Van Gelder and F. Okushi. A propositional theorem prover to solve planning and other problems. AMAI, 26:87–112, 1999.

    MathSciNet  MATH  Google Scholar 

  14. A. Van Gelder and Y. K. Tsuji. Satisfiability testing with more reasoning and less guessing. Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1996.

    Google Scholar 

  15. T. Stützle H. Hoos. Satlib-the satisfiability library. http://www.informatik.tudarmstadt.de/AI/SATLIB, 1998.

  16. M. Stickel H. Zhang. Implementing Davis-Putnam’s method by tries. Technical report, The University of Iowa, 1994.

    Google Scholar 

  17. R. Dechter I. Rish. Resolution versus search: Two strategies for sat. In I. Gent et al., editor, SAT2000, pages 215–259. IOS Press, 2000.

    Google Scholar 

  18. J. Crawford and L. Auton. Experimental results on the cross-over point in satisfiability problems. In AAAI-93, pages 21–27, 1993.

    Google Scholar 

  19. C. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of IJCAI-97, 1997.

    Google Scholar 

  20. D. W. Loveland. Mechanical theorem-proving by model elimination. Journal of the ACM, 15:236–251, 1968.

    Article  MathSciNet  MATH  Google Scholar 

  21. D. W. Loveland. A simplified format for the model elimination theorem-proving procedure. Journal of the ACM, 16:349–363, 1969.

    Article  MathSciNet  MATH  Google Scholar 

  22. G. Logemann M. Davis and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5:394–397, 1962.

    Article  MathSciNet  MATH  Google Scholar 

  23. J. Minker and G. Zanon. An extension to linear resolution with selection function. Information Processing Letters, 14:191–194, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  24. B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2n steps. Discrete Applied Mathematics, 10:287–295, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  25. D. A. Plaisted. The search efficiency of theorem proving strategies. In Twelfth CADE, volume 814 of LNAI, pages 57–71. Springer Verlag, 1994.

    Google Scholar 

  26. A. K. Smiley S. Fleisig, D. W. Loveland and D. L. Yarmush. An implementation of the model elimination proof procedure. Journal of the ACM, 21:124–139, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  27. João P. Marques Silva. An overview of backtrack search satisfiability algorithms. In Fifth International Symposium on Artificial Intelligence and Mathematics, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIS, Dipartimento di Informatica e Sistemistica Facoltà di Ingegneria, Università di Roma “La Sapienza”, Italy

    Marco Benedetti

Authors
  1. Marco Benedetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia

    Rajeev Goré

  2. AG Theoretische Informatik und Logik, Institut für Computersprachen, Technische Universität Wien, Favoritenstr. 9, E185-2, 1040, Wien, Austria

    Alexander Leitsch

  3. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benedetti, M. (2001). Conditional Pure Literal Graphs. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45744-5_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45744-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation