Article

Clause form conversions for boolean circuits

Authors:

Paul Jackson,

Daniel SheridanAuthors Info & Claims

SAT'04: Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Pages 183 - 198

https://doi.org/10.1007/11527695_15

Published: 10 May 2004 Publication History

Publisher Site

Abstract

The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for converting Boolean circuits to clause form (naming every vertex) has a number of shortcomings.

In this paper we give a projection of several well-known clause form conversions to a simplified form of Boolean circuit. We introduce a new conversion which we show is equivalent to that of Boy de la Tour in certain circumstances and is hence optimal in the number of clauses that it produces. We extend the algorithm to cover reduced Boolean circuits, a data structure used by the model checker NuSMV.

We present experimental results for this and other conversion procedures on BMC problems demonstrating its superiority, and conclude that the CNF conversion has a significant role in reducing the overall solving time.

References

[1]

Parosh Aziz Abdulla, Per Bjesse, and Niklas Eén. Symbolic reachability analysis based on SAT-solvers. In S. Graf and M. Schwartzbach, editors, Tools and Algorithms for the Construction and Analysis of Systems, 6th International Conference, TACAS'00, volume 1785 of Lecture Notes in Computer Science, pages 411-425. Springer-Verlag, March 2000.

Digital Library

Google Scholar

[2]

Olivier Bailleux and Yacine Boufkhad. Efficient CNF encoding of Boolean cardinality constraints. In Principles and Practice of Constraint Programming -- 9th International Conference, CP 2003, Lecture Notes in Computer Science, 2003.

Google Scholar

[3]

Armin Biere, Alessandro Cimatti, Edmund Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In W.R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems. 5th International Conference, TACAS'99, volume 1579 of Lecture Notes in Computer Science, pages 193-207. Springer-Verlag, July 1999.

Digital Library

Google Scholar

[4]

Thierry Boy de la Tour. An optimality result for clause form translation. Journal of Symbolic Computation, 14:283-301, 1992.

Digital Library

Google Scholar

[5]

A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier. In N. Halbwachs and D. Peled, editors, Proceedings of the Eleventh Conference on Computer-Aided Verification (CAV'99), number 1633 in Lecture Notes in Computer Science, pages 495-499, Trento, Italy, July 1999. Springer-Verlag.

Digital Library

Google Scholar

[6]

M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In 39th Design Automation Conference, pages 530-535, Las Vegas, June 2001.

Digital Library

Google Scholar

[7]

Alexander Nadel. Backtrack search algorithms for propositional logic satisfiability: Review and innovations. Master's thesis, Tel-Aviv University, November 2002.

Google Scholar

[8]

Andreas Nonnengart, Georg Rock, and Christoph Weidenbach. On generating small clause normal forms. In Claude Kirchner and Hélène Kirchner, editors, Fifteenth International Conference on Automated Deduction, volume 1421 of Lecture Notes in Artificial Intelligence, pages 397-411. Springer-Verlag, 1998.

Digital Library

Google Scholar

[9]

David A. Plaisted and Steven Greenbaum. A structure-preserving clause form translation. Journal of Symbolic Computation, 2(3):293-304, September 1986.

Digital Library

Google Scholar

[10]

M. N. Velev. Efficient translation of Boolean formulas to CNF in formal verification of microprocessors. In Asia and South Pacific Design Automation Convference (ASP-DAC '04), January 2004.

Digital Library

Google Scholar

Cited By

View all

Vavrille M(2023)A feature commonality-based search strategy to find high -wise covering solutions in feature modelsConstraints10.1007/s10601-023-09366-z28:4(521-548)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1007/s10601-023-09366-z
Lu LYang WPan MZhang T(2020)SAT and LP Collaborative Bounded Timing Analysis of Scenario-Based SpecificationsProceedings of the 12th Asia-Pacific Symposium on Internetware10.1145/3457913.3457917(229-239)Online publication date: 1-Nov-2020
https://dl.acm.org/doi/10.1145/3457913.3457917
Surynek P(2015)On the Complexity of Optimal Parallel Cooperative Path-FindingFundamenta Informaticae10.5555/2751306.2751310137:4(517-548)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.5555/2751306.2751310
Show More Cited By

Recommendations

Clause/term resolution and learning in the evaluation of quantified Boolean formulas

Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable formula in conjunctive normal form (CNF) and then represented as a set of ...
Clause elimination for SAT and QSAT

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarative programming paradigms through which real-world instances of ...
Simulation of one-way cellular automata by boolean circuits

We present a relationship between two major models of parallel computation: the one-way cellular automata and the boolean circuits. The starting point is the boolean circuit of small depth designed by Ladner and Fischer to simulate any rational ...

Comments

Information & Contributors

Information

Published In

SAT'04: Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

May 2004

393 pages

ISBN:354027829X

Editors:
Holger H. Hoos
Department of Computer Science, University of British Columbia Vancouver, B.C., Canada
,
David G. Mitchell
Computational Logic Laboratory, Simon Fraser University, Burnaby, BC, Canada

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 10 May 2004

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vavrille M(2023)A feature commonality-based search strategy to find high -wise covering solutions in feature modelsConstraints10.1007/s10601-023-09366-z28:4(521-548)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1007/s10601-023-09366-z
Lu LYang WPan MZhang T(2020)SAT and LP Collaborative Bounded Timing Analysis of Scenario-Based SpecificationsProceedings of the 12th Asia-Pacific Symposium on Internetware10.1145/3457913.3457917(229-239)Online publication date: 1-Nov-2020
https://dl.acm.org/doi/10.1145/3457913.3457917
Surynek P(2015)On the Complexity of Optimal Parallel Cooperative Path-FindingFundamenta Informaticae10.5555/2751306.2751310137:4(517-548)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.5555/2751306.2751310
Torlak EBodik RHosking AEugster PHirschfeld R(2013)Growing solver-aided languages with rosetteProceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software10.1145/2509578.2509586(135-152)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2509578.2509586
Maratea M(2012)Planning as satisfiability with IPC simple preferences and action costsAI Communications10.5555/2594622.259462825:4(343-360)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.5555/2594622.2594628
Giunchiglia EMaratea M(2012)Algorithms for solving satisfiability problems with qualitative preferencesCorrect Reasoning10.5555/2363344.2363366(327-344)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.5555/2363344.2363366
Rintanen J(2011)Heuristics for planning with SAT and expressive action definitionsProceedings of the Twenty-First International Conference on International Conference on Automated Planning and Scheduling10.5555/3038485.3038513(210-217)Online publication date: 11-Jun-2011
https://dl.acm.org/doi/10.5555/3038485.3038513
Chambers BManolios PVroon DBenini LDe Micheli GAl-Hashimi BMueller W(2009)Faster SAT solving with better CNF generationProceedings of the Conference on Design, Automation and Test in Europe10.5555/1874620.1875002(1590-1595)Online publication date: 20-Apr-2009
https://dl.acm.org/doi/10.5555/1874620.1875002
Shankar N(2009)Automated deduction for verificationACM Computing Surveys10.1145/1592434.159243741:4(1-56)Online publication date: 9-Oct-2009
https://dl.acm.org/doi/10.1145/1592434.1592437
Manolios PSrinivasan SVroon D(2007)BATProceedings of the 19th international conference on Computer aided verification10.5555/1770351.1770398(303-306)Online publication date: 3-Jul-2007
https://dl.acm.org/doi/10.5555/1770351.1770398
Show More Cited By

Abstract

References

Cited By

Recommendations

Clause/term resolution and learning in the evaluation of quantified Boolean formulas

Clause elimination for SAT and QSAT

Simulation of one-way cellular automata by boolean circuits

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations