Skip to main content
SpringerLink
Log in

A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 1999)

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

Abstract

This paper reports on a series of experiments performed with the aim of comparing the performance of Regular-DP and Regular-GSAT. Regular-DP is a Davis-Putnam-style procedure for solving the propositional satisfiability problem in regular CNF formulas (regular SAT). Regular-GSAT is a GSAT-style procedure for finding satisfying interpretations in regular CNF formulas. Our experimental results provide experimental evidence that Regular-GSAT outperforms Regular-DP on computationally difficult regular random 3-SAT instances, and suggest that local search methods can extend the range and size of satisfiability problems that can be efficiently solved in many-valued logics.

Research partially supported by the project CICYT TIC96-1038-C04-03 and “La Paeria”. The first author is supported by a doctoral fellowship of the Comissionat per a Universitat i Recerca (1998FI00326).

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 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. R. Béjar and F. Manyà. Phase transitions in the regular random 3-SAT problem. In Proceedings of the International Symposium on Methodologies for Intelligent Systems, ISMIS’99, pages 292–300. Springer LNAI 1609, 1999.

    Google Scholar 

  2. R. Hähnle. Uniform notation of tableaux rules for multiple-valued logics. In Proceedings International Symposium on Multiple-Valued Logic, Victoria, pages 238–245. IEEE Press, 1991.

    Google Scholar 

  3. R. Hähnle. Short conjunctive normal forms infinitely-valued logics. Journal of Logic and Computation, 4(6):905–927, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Hähnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6:49–69, 1996.

    Google Scholar 

  5. R. Hähnle. Personal communication, 1998.

    Google Scholar 

  6. J. N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15:359–383, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  7. F. Manyà R. Béjar, and G. Escalada-Imaz. The satisfiability problem in regular CNF-formulas. Soft Computing: A Fusion of Foundations, Methodologies and Applications, 2(3):116–123, 1998.

    Article  Google Scholar 

  8. D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI’97, Providence/RI, USA, pages 321–326, 1997.

    Google Scholar 

  9. B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI’94, Seattle/WA, USA, pages 337–343, 1994.

    Google Scholar 

  10. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI’92, San Jose/CA, USA, pages 440–446, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament d’Informàtica, Universitat de Lleida, Jaume II, 69, E-25001, Lleida, Spain

    Ramón Béjar & Felip Manyà

Authors
  1. Ramón Béjar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Felip Manyà
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK

    Anthony Hunter

  2. Department of Electronic Engineering, University of London, Queen Mary and Westfield College, E1 4NS, London, UK

    Simon Parsons

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Béjar, R., Manyà, F. (1999). A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48747-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66131-3

  • Online ISBN: 978-3-540-48747-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation