A Compact Representation for Syntactic Dependencies in QBFs

DOI10.1007/978-3-642-02777-2_37zbMath1247.68238OpenAlexW1608173173MaRDI QIDQ3637175

Florian Lonsing, Armin Biere

Publication date: 7 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_37

Mathematics Subject Classification ID

Related Items (1)

Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers

Uses Software

• QuBE++
• Quaffle
• QUBOS
• QUBE
• Quantor
• semprop
• sKizzo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Backjumping for quantified Boolean logic satisfiability
• Backdoor sets of quantified Boolean formulas
• Resolution for quantified Boolean formulas
• Theory and applications of satisfiability testing -- SAT 2007. 10th international conference, Lisbon, Portugal, May 28--31, 2007. Proceedings
• Theory and applications of satisfiability testing. 8th international conference, SAT 2005, St Andrews, UK, June 19--23, 2005. Proceedings.
• Compressing BMC Encodings with QBF
• A First Step Towards a Unified Proof Checker for QBF
• Bounded Universal Expansion for Preprocessing QBF
• Efficiency of a Good But Not Linear Set Union Algorithm
• Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
• Theory and Applications of Satisfiability Testing
• Automated Deduction – CADE-20
• Formal Methods in Computer-Aided Design
• The Transitive Reduction of a Directed Graph
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

This page was built for publication: A Compact Representation for Syntactic Dependencies in QBFs