Variable Dependencies of Quantified CSPs

DOI10.1007/978-3-540-89439-1_36zbMath1182.68268OpenAlexW4229617267MaRDI QIDQ5505578

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)

Related Items (7)

Preprocessing for DQBF ⋮ Soundness of \(\mathcal{Q}\)-resolution with dependency schemes ⋮ Failed Literal Detection for QBF ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ Reinterpreting dependency schemes: soundness meets incompleteness in DQBF ⋮ Backdoor sets of quantified Boolean formulas ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1

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