Exploiting unfounded sets for HEX-program evaluation
From MaRDI portal
Recommendations
- Efficient HEX-Program Evaluation Based on Unfounded Sets
- Exploiting partial assignments for efficient evaluation of answer set programs with external source access
- Inlining external sources in answer set programs
- Conflict-driven ASP solving with external sources
- Answer set programming with external sources
Cites work
- Conflict-driven answer set solving: from theory to practice
- Conflict-driven ASP solving with external sources
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Efficient HEX-Program Evaluation Based on Unfounded Sets
- Enhancing disjunctive logic programming systems by SAT checkers
- Finding explanations of inconsistency in multi-context systems
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- Logic Programming and Nonmonotonic Reasoning
- 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
- Semantics and complexity of recursive aggregates in answer set programming
Cited in
(6)- The Hexlite solver. Lightweight and efficient evaluation of HEX programs
- FLP answer set semantics without circular justifications for general logic programs
- Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
- Finding explanations of inconsistency in multi-context systems
- Inlining external sources in answer set programs
- Efficient HEX-Program Evaluation Based on Unfounded Sets
This page was built for publication: Exploiting unfounded sets for HEX-program evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915067)