Variable Dependencies of Quantified CSPs

DOI10.1007/978-3-540-89439-1_36MaRDI QIDQ5505578zbMATH OpenOpenAlexFDO

Authors Marko Samer

Publication date 27 January 2009

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89439-1_36

Mathematics Subject Classification ID

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

Recommendations

• Generalizing consistency and other constraint properties to quantified constraints
• Relatively quantified constraint satisfaction
• Principles and Practice of Constraint Programming – CP 2004
• Solving quantified constraint satisfaction problems
• Variable independence and resolution paths for quantified Boolean formulas

Cited in

(8)

• Backdoor sets of quantified Boolean formulas
• Pruning external minimality checking for answer set programs using semantic dependencies
• Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
• Failed literal detection for QBF
• Preprocessing for DQBF
• Variable Elimination in Binary CSPs
• The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
• Soundness of \(\mathcal{Q}\)-resolution with dependency schemes

This page was built for publication: Variable Dependencies of Quantified CSPs

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