Abstract answer set solvers with backjumping and learning

DOI10.1017/S1471068410000578zbMath1220.68038OpenAlexW1964233932MaRDI QIDQ3008404

Yuliya Lierler

Publication date: 15 June 2011

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068410000578

zbMATH Keywords

learninginferenceanswer set programming

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (11)

On abstract modular inference systems and solvers ⋮ Disjunctive answer set solvers via templates ⋮ Abstract Solvers for Computing Cautious Consequences of ASP programs ⋮ What is answer set programming to propositional satisfiability ⋮ Stepwise debugging of answer-set programs ⋮ Constraint CNF: SAT and CSP Language Under One Roof. ⋮ Relating constraint answer set programming languages and algorithms ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Boosting Answer Set Optimization with Weighted Comparator Networks ⋮ Transition systems for model generators—A unifying approach ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications

Uses Software

• MiniSat

This page was built for publication: Abstract answer set solvers with backjumping and learning