Skip to main content
SpringerLink
Log in

Coprocessor 2.0 – A Flexible CNF Simplifier

(Tool Presentation)

  • Conference paper
Theory and Applications of Satisfiability Testing – SAT 2012 (SAT 2012)

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

Abstract

This paper presents the CNF simplifier Coprocessor 2.0, an extension of Coprocessor [1]. It implements almost all currently known simplification techniques in a modular way and provides access to each single technique to execute them independently. Disabling preprocessing for a set of variables is also possible and enables to apply simplifications also for incremental SAT solving. Experiments show that Coprocessor 2.0 performs better than its predecessor or SatElite[2].

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. Manthey, N.: Coprocessor – a Standalone SAT Preprocessor. In: Proceedings of the 25th Workshop on Logic Programming, WLP 2011, Infsys Research Report 1843-11-06, Technische Universität Wien, 99–104 (2011)

    Google Scholar 

  2. Eén, N., Biere, A.: Effective Preprocessing in SAT Through Variable and Clause Elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Järvisalo, M., Biere, A., Heule, M.: Blocked Clause Elimination. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 129–144. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Heule, M., Järvisalo, M., Biere, A.: Clause Elimination Procedures for CNF Formulas. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 357–371. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Berre, D.L., Parrain, A.: The Sat4j library, release 2.2. JSAT 7(2-3), 56–59 (2010)

    Google Scholar 

  6. Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electr. Notes Theor. Comput. Sci. 89(4), 543–560 (2003)

    Article  Google Scholar 

  7. Lynce, I., Marques-Silva, J.: Probing-Based Preprocessing Techniques for Propositional Satisfiability. In: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2003. IEEE Computer Society (2003)

    Google Scholar 

  8. Li, C.M.: A constraint-based approach to narrow search trees for satisfiability. Inf. Process. Lett. 71, 75–80 (1999)

    Article  MATH  Google Scholar 

  9. Piette, C., Hamadi, Y., Saïs, L.: Vivifying propositional clausal formulae. In: 18th European Conference on Artificial Intelligence (ECAI 2008), Patras, Greece, pp. 525–529 (2008)

    Google Scholar 

  10. Heule, M.J.H., Järvisalo, M., Biere, A.: Efficient CNF Simplification Based on Binary Implication Graphs. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 201–215. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Van Gelder, A.: Toward leaner binary-clause reasoning in a satisfiability solver. Ann. Math. Artif. Intell. 43(1), 239–253 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Manthey, N., Steinke, P.: Quadratic Direct Encoding vs. Linear Order Encoding. Technical Report 3, Knowledge Representation and Reasoning Group, Technische Universität Dresden, 01062 Dresden, Germany (2011)

    Google Scholar 

  13. Chen, J.: A New SAT Encoding of the At-Most-One Constraint. In: Proceedings of ModRef 2011 (2011)

    Google Scholar 

  14. Wernhard, C.: Computing with Logic as Operator Elimination: The ToyElim System. In: Proceedings of the 25th Workshop on Logic Programming, WLP 2011, Infsys Research Report 1843-11-06, Technische Universität Wien, pp. 94–98 (2011)

    Google Scholar 

  15. Biere, A.: Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010. Technical Report 10/1, Institute for Formal Models and Verification, Johannes Kepler University (2010)

    Google Scholar 

  16. Soos, M.: CryptoMiniSat 2.5.0. In: SAT Race Competitive Event Booklet (2010)

    Google Scholar 

  17. Manthey, N.: Solver Description of riss and priss. Technical Report 2, Knowledge Representation and Reasoning Group, Technische Universität Dresden, 01062 Dresden, Germany (2012)

    Google Scholar 

  18. Brummayer, R., Biere, A.: Fuzzing and delta-debugging smt solvers. In: Proceedings of the 7th International Workshop on Satisfiability Modulo Theories, SMT 2009, pp. 1–5. ACM, New York (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Knowledge Representation and Reasoning Group, Technische Universität Dresden, 01062, Dresden, Germany

    Norbert Manthey

Authors
  1. Norbert Manthey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Information Technology, Fondazione Bruno Kessler, via Sommarive 18, Povo, 38123, Trento, Italy

    Alessandro Cimatti

  2. Department of Information Engineering and Computer Science, University of Trento, via Sommarive 14, Povo, 38123, Trento, Italy

    Roberto Sebastiani

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manthey, N. (2012). Coprocessor 2.0 – A Flexible CNF Simplifier. In: Cimatti, A., Sebastiani, R. (eds) Theory and Applications of Satisfiability Testing – SAT 2012. SAT 2012. Lecture Notes in Computer Science, vol 7317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31612-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31612-8_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31611-1

  • Online ISBN: 978-3-642-31612-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation