Antichain-Based QBF Solving

DOI10.1007/978-3-642-24372-1_14MaRDI QIDQ3172913zbMATH OpenOpenAlexFDO

Authors Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin

Publication date 7 October 2011

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24372-1_14

Mathematics Subject Classification ID

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

Recommendations

• Solving QBF with counterexample guided refinement
• Solving QBF with counterexample guided refinement
• Solving QBF by abstraction
• Non-prenex QBF solving using abstraction
• Beyond CNF: A Circuit-Based QBF Solver
• CAQE and QuAbS: Abstraction Based QBF Solvers
• QBF Resolution Systems and Their Proof Complexities
• Exploiting circuit representations in QBF solving
• Formal Methods in Computer-Aided Design

Cited in

(4)

• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 7327941 (Why is no real title available?)
• Iterative and core-guided maxsat solving: a survey and assessment
• CAQE and QuAbS: Abstraction Based QBF Solvers

Describes a project that uses

Uses Software

• QuBE++

This page was built for publication: Antichain-Based QBF Solving

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