Simplifying Binary Propositional Theories into Connected Components Twice as Fast
Author:
- 20 November 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 392-406
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Satisfiability testing with more reasoning and less guessing1996
- On finding the strongly connected components in a directed graphInformation Processing Letters, 1994
- 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.1994
- Test pattern generation using Boolean satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A machine program for theorem-provingCommunications of the ACM, 1962