Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares

DOI10.1007/11814948_34MaRDI QIDQ5756554zbMATH OpenOpenAlexFDO

Authors Daijue Tang, Sharad Malik

Publication date 4 September 2007

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Beyond CNF: A Circuit-Based QBF Solver
• Exploiting circuit representations in QBF solving
• Theory and Applications of Satisfiability Testing
• Using SAT in QBF
• scientific article; zbMATH DE number 5542982

Cited in

(3)

• Improved SAT-based reachability analysis with observability don't cares
• Beyond CNF: A Circuit-Based QBF Solver
• Exploiting circuit representations in QBF solving

Describes a project that uses

Uses Software

• Quaffle

This page was built for publication: Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares

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