ZRes: The Old Davis–Putnam Procedure Meets ZBDD
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 449-454
- https://doi.org/10.1007/10721959_35
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Binary Decision DiagramsPublished by Springer Nature ,1998
- SATO: An efficient propositional proverLecture Notes in Computer Science, 1997
- Directional Resolution: The Davis-Putnam Procedure, Revisited **This work was partially supported by NSF grant IRI-9157636, by Air Force Office of Scientific Research grant AFOSR 900136, by Toshiba of America, and by a Xerox grant.Published by Elsevier ,1994
- Zero-suppressed BDDs for set manipulation in combinatorial problemsPublished by Association for Computing Machinery (ACM) ,1993
- Hard examples for resolutionJournal of the ACM, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- The intractability of resolutionTheoretical Computer Science, 1985
- On the complexity of regular resolution and the Davis-Putnam procedureTheoretical Computer Science, 1977
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960