Conflict-driven ASP solving with external sources

DOI10.1017/S1471068412000233zbMath1260.68060arXiv1210.1649WikidataQ57549085 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

zbMATH Keywords

nonmonotonic reasoning; answer set programming; conflict-driven clause learning

Mathematics Subject Classification ID

68N17: Logic programming

Related Items

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, Inlining External Sources in Answer Set Programs, Multi-shot ASP solving with clingo, Domain expansion for ASP-programs with external sources, On abstract modular inference systems and solvers, FLP answer set semantics without circular justifications for general logic programs, Exploiting Unfounded Sets for HEX-Program Evaluation, Clause-Learning for Modular Systems

Uses Software

• Potassco

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