Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
From MaRDI portal
Publication:3460072
DOI10.1007/978-3-662-48899-7_29zbMath1471.68251OpenAlexW2294843272MaRDI QIDQ3460072
Fahiem Bacchus, Martina Seidl, Armin Biere, Uwe Egly, Florian Lonsing
Publication date: 12 January 2016
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-662-48899-7_29
Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (13)
Solution validation and extraction for QBF preprocessing ⋮ Conformant planning as a case study of incremental QBF solving ⋮ Long-distance Q-resolution with dependency schemes ⋮ The power of non-ground rules in Answer Set Programming ⋮ A game characterisation of tree-like Q-resolution size ⋮ Truth Assignments as Conditional Autarkies ⋮ Unnamed Item ⋮ Super-Blocked Clauses ⋮ Q-Resolution with Generalized Axioms ⋮ Long Distance Q-Resolution with Dependency Schemes ⋮ HordeQBF: A Modular and Massively Parallel QBF Solver ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers
Uses Software
This page was built for publication: Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
