Abstract solvers for quantified Boolean formulas and their applications

DOI10.1007/978-3-319-24309-2_16MaRDI QIDQ2294081zbMATH OpenOpenAlexFDO

Authors Marco Maratea, Rémi Brochenin

Publication date 10 February 2020

Full work available at URL https://doi.org/10.1007/978-3-319-24309-2_16

Mathematics Subject Classification ID

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

Recommendations

• Theory and Applications of Satisfiability Testing
• CAQE and QuAbS: Abstraction Based QBF Solvers
• Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
• Abstract Solvers for Computing Cautious Consequences of ASP programs
• Abstraction-based algorithm for 2QBF

Cited in

(6)

• A self-adaptive multi-engine solver for quantified Boolean formulas
• scientific article; zbMATH DE number 5139165 (Why is no real title available?)
• scientific article; zbMATH DE number 2090051 (Why is no real title available?)
• CAQE and QuAbS: Abstraction Based QBF Solvers
• scientific article; zbMATH DE number 6747884 (Why is no real title available?)
• Boolean functional synthesis: from under the hood of solvers

This page was built for publication: Abstract solvers for quantified Boolean formulas and their applications

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