Conflict-driven ASP solving with external sources
From MaRDI portal
Publication:4911141
DOI10.1017/S1471068412000233zbMath1260.68060arXiv1210.1649OpenAlexW3103165021WikidataQ57549085 ScholiaQ57549085MaRDI QIDQ4911141
Thomas Krennwallner, Thomas Eiter, Christoph Redl, Michael Fink
Publication date: 13 March 2013
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.1649
Related Items (12)
On abstract modular inference systems and solvers ⋮ Clause-Learning for Modular Systems ⋮ Exploiting Unfounded Sets for HEX-Program Evaluation ⋮ Rewriting recursive aggregates in answer set programming: back to monotonicity ⋮ A model building framework for answer set programming with external computations ⋮ The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description) ⋮ Clingcon: The next generation ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Multi-shot ASP solving with clingo ⋮ Inlining External Sources in Answer Set Programs ⋮ Domain expansion for ASP-programs with external sources
Uses Software
Cites Work
- Semantics and complexity of recursive aggregates in answer set programming
- ASSAT: computing answer sets of a logic program by SAT solvers
- Answer set programming based on propositional satisfiability
- Exploiting conjunctive queries in description logic programs
- Answer set programming and plan generation
- Extending and implementing the stable model semantics
- Logic programs with stable model semantics as a constraint programming paradigm
- Combining answer set programming with description logics for the semantic web
- BerkMin: A fast and robust SAT-solver
- The DLV system for knowledge representation and reasoning
This page was built for publication: Conflict-driven ASP solving with external sources
