Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
From MaRDI portal
Publication:4930579
DOI10.1007/978-3-642-14186-7_7zbMath1306.68042OpenAlexW1491702378MaRDI QIDQ4930579
Hans Kleine Büning, Uwe Bubeck
Publication date: 29 September 2010
Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_7
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
This page was built for publication: Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN