Exploiting Unfounded Sets for HEX-Program Evaluation

DOI10.1007/978-3-642-33353-8_13zbMath1361.68030WikidataQ57549088 ScholiaQ57549088MaRDI QIDQ2915067

Michael Fink, Peter Schüller, Thomas Eiter, Thomas Krennwallner, Christoph Redl

Publication date: 21 September 2012

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33353-8_13

zbMATH Keywords

nonmonotonic reasoning; answer set programming; FLP semantics; unfounded sets

Mathematics Subject Classification ID

68N17: Logic programming

Related Items

Finding explanations of inconsistency in multi-context systems, FLP answer set semantics without circular justifications for general logic programs

Cites Work

• Unnamed Item
• Finding explanations of inconsistency in multi-context systems
• Semantics and complexity of recursive aggregates in answer set programming
• Enhancing disjunctive logic programming systems by SAT checkers
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Conflict-driven answer set solving: from theory to practice
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
• Conflict-driven ASP solving with external sources
• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Logic Programming and Nonmonotonic Reasoning