Using Boolean Constraint Propagation for Sub-clauses Deduction
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 757-761
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Equivalency reasoning to solve a class of hard SAT problemsInformation Processing Letters, 2000
- Boolean satisfiability in electronic design automation2000
- Verifying Safety Properties of a PowerPC− Microprocessor Using Symbolic Model Checking without BDDs1999
- A machine program for theorem-provingCommunications of the ACM, 1962