Quantifier trees for QBFs

DOI10.1007/11499107_28MaRDI QIDQ5713726zbMATH OpenOpenAlexFDO

Authors Marco H. Benedetti

Publication date 15 December 2005

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

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

zbMATH Keywords

Quantified Boolean Formulas

Mathematics Subject Classification ID

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

Recommendations

• Formal Methods in Computer-Aided Design
• Expansion-based QBF solving on tree decompositions
• Integrating dependency schemes in search-based QBF solvers
• Principles and Practice of Constraint Programming – CP 2004
• Resolve and expand

Cited in

(11)

• Backdoor sets of quantified Boolean formulas
• QBF as an alternative to Courcelle's theorem
• Solving dependency quantified Boolean formulas using quantifier localization
• On Stronger Calculi for QBFs
• Strong WQO Tree Theorems
• A Compact Representation for Syntactic Dependencies in QBFs
• Cardinality Quantifiers in MLO over Trees
• Understanding Gentzen and Frege Systems for QBF
• GhostQ. System description
• Efficiently representing existential dependency sets for expansion-based QBF solvers
• Recovering and utilizing partial duality in QBF

Describes a project that uses

Uses Software

• QuBE++

This page was built for publication: Quantifier trees for QBFs

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