ALLQBF solving by computational learning

DOI10.1007/978-3-642-33386-6_29MaRDI QIDQ4649309zbMATH OpenOpenAlexFDO

Authors Bernd Becker, Rüdiger Ehlers, Matthew Lewis, Paolo Marin

Publication date 21 November 2012

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-33386-6_29

zbMATH Keywords

computational learningQBFQBF model enumeration

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Theory and Applications of Satisfiability Testing
• Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
• QELL: QBF reasoning with extended clause learning and levelized SAT solving
• Dependency Learning for QBF
• Dependency learning for QBF

Cited in

(5)

• Learning to integrate deduction and search in reasoning about quantified Boolean formulas
• Theory and Applications of Satisfiability Testing
• OuterCount: a first-level solution-counter for quantified Boolean formulas
• Models and counter-models of quantified Boolean formulas (invited talk)
• Refinement-based enumeration of QBF solutions

Describes a project that uses

Uses Software

• PaQuBE

This page was built for publication: ALLQBF solving by computational learning

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