Pages that link to "Item:Q5096299"

The following pages link to Ordered Binary Decision Diagrams and the Davis-Putnam procedure (Q5096299):

Displaying 16 items.

• Using OBDDs to handle dynamic constraints (Q290226) (← links)
• 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 the Width of Ordered Binary Decision Diagrams (Q2942417) (← links)
• Ordered binary decision diagrams and minimal trellises (Q4571421) (← 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)
• On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q5047172) (← links)
• A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
• (Q5121904) (← links)
• Principles and Practice of Constraint Programming – CP 2004 (Q5900286) (← links)
• Stålmarck's algorithm as a HOL derived rule (Q6567714) (← links)