Abstract Answer Set Solvers
From MaRDI portal
Publication:5504668
DOI10.1007/978-3-540-89982-2_35zbMath1185.68165OpenAlexW1523419405MaRDI QIDQ5504668
Publication date: 22 January 2009
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_35
Related Items
Disjunctive answer set solvers via templates, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, Abstract Solvers for Computing Cautious Consequences of ASP programs, Constraint CNF: SAT and CSP Language Under One Roof., Relating constraint answer set programming languages and algorithms, On the relation among answer set solvers
Uses Software
Cites Work
- ASSAT: computing answer sets of a logic program by SAT solvers
- Answer set programming based on propositional satisfiability
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Solving SAT and SAT Modulo Theories
- The well-founded semantics for general logic programs
- Theory and Applications of Satisfiability Testing
- Logic Programming and Nonmonotonic Reasoning
- Tableau Calculi for Answer Set Programming
- Logic Programming
- A machine program for theorem-proving