Pages that link to "Item:Q5096299"
From MaRDI portal
The following pages link to Ordered Binary Decision Diagrams and the Davis-Putnam procedure (Q5096299):
Displayed 10 items.
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). (Q1854375) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
- ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← links)
- On sets, types, fixed points, and checkerboards (Q4645222) (← links)
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal K (Q4647549) (← links)
- (Q5121904) (← links)
- Generating Extended Resolution Proofs with a BDD-Based SAT Solver (Q6082228) (← links)