Dependency Quantified Horn Formulas: Models and Complexity
From MaRDI portal
Publication:5756561
DOI10.1007/11814948_21zbMath1187.68256OpenAlexW1575955626MaRDI QIDQ5756561
Hans Kleine Büning, Uwe Bubeck
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11814948_21
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Preprocessing for DQBF, Henkin quantifiers and Boolean formulae: a certification perspective of DQBF, Complexity of validity for propositional dependence logics, Building strategies into QBF proofs, Dependency Schemes for DQBF, Reinterpreting dependency schemes: soundness meets incompleteness in DQBF, The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1, Davis and Putnam meet Henkin: solving DQBF with resolution, Certified DQBF solving by definition extraction
