Solution Enumeration for Projected Boolean Search Problems

DOI10.1007/978-3-642-01929-6_7zbMath1241.68100OpenAlexW1544757461MaRDI QIDQ3630153

Torsten Schaub, Martin Gebser, Benjamin Kaufmann

Publication date: 3 June 2009

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01929-6_7

Mathematics Subject Classification ID

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

Related Items (18)

Projection, consistency, and George Boole ⋮ On abstract modular inference systems and solvers ⋮ Answer Set Programming Modulo Acyclicity ⋮ $$\#\exists $$ SAT: Projected Model Counting ⋮ On minimal constraint networks ⋮ Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Solution Enumeration by Optimality in Answer Set Programming ⋮ Lifted inference for statistical statements in probabilistic answer set programming ⋮ A model building framework for answer set programming with external computations ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ Statistical statements in probabilistic logic programming ⋮ Disjunctive closures for knowledge compilation ⋮ Conflict-driven answer set solving: from theory to practice ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ Definability for model counting ⋮ Automatic network reconstruction using ASP ⋮ Knowledge representation analysis of graph mining ⋮ Implementing Efficient All Solutions SAT Solvers

Uses Software

• Siege
• Chaff

This page was built for publication: Solution Enumeration for Projected Boolean Search Problems