Multi-resolution on compressed sets of clauses
- 7 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Mathematical foundations of minimal cutsetsIEEE Transactions on Reliability, 2001
- 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 Computing Procedure for Quantification TheoryJournal of the ACM, 1960