Efficient HEX-Program Evaluation Based on Unfounded Sets
From MaRDI portal
Recommendations
- Exploiting unfounded sets for HEX-program evaluation
- Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
- The Hexlite solver. Lightweight and efficient evaluation of HEX programs
- Hex semantics via approximation fixpoint theory
- scientific article; zbMATH DE number 2102784
- A formal framework for evaluating heuristic programs
- ON THE COMPUTING POWER OF PROGRAMS WITH SETS
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Satisfiability modulo heap-based programs
- An algorithm for general set unification and its complexity
Cited in
(12)- Domain expansion for ASP-programs with external sources
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- A model building framework for answer set programming with external computations
- Hybrid planning for challenging construction problems: an answer set programming approach
- Inlining external sources in answer set programs
- Data repair of inconsistent nonmonotonic description logic programs
- Pruning external minimality checking for answer set programs using semantic dependencies
- Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
- Exploiting unfounded sets for HEX-program evaluation
- Sub-propositional fragments of the interval temporal logic of Allen's relations
- Complexity and compilation of GZ-aggregates in answer set programming
- Rewriting recursive aggregates in answer set programming: back to monotonicity
This page was built for publication: Efficient HEX-Program Evaluation Based on Unfounded Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404394)
