Theory and Applications of Satisfiability Testing

DOI10.1007/11527695MaRDI QIDQ5714748zbMATH OpenOpenAlexFDO

Authors Jinbo Huang, Adnan Darwiche

Publication date 16 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11527695

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Ordered binary decision diagrams and the Davis-Putnam procedure
• Theory and Applications of Satisfiability Testing
• On the complexity of constructing optimal ordered binary decision diagrams
• Introduction to the OBDD algorithm for the ATP community
• ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES

Cited in

(7)

• Introduction to the OBDD algorithm for the ATP community
• Estimating the volume of solution space for satisfiability modulo linear real arithmetic
• On preprocessing techniques and their impact on propositional model counting
• Binary decision diagrams
• A study of symmetry breaking predicates and model counting
• Implementing efficient All solutions SAT solvers
• On CNF conversion for SAT and SMT enumeration

Describes a project that uses

Uses Software

• SATLIB
• CUDD
• FORCE

This page was built for publication: Theory and Applications of Satisfiability Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714748)