Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

DOI10.1007/978-3-642-20895-9_10MaRDI QIDQ3003246zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Thomas Eiter, Michael Fink, Giovambattista Ianni, Thomas Krennwallner, Peter Schüller

Publication date 26 May 2011

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20895-9_10

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Efficient HEX-Program Evaluation Based on Unfounded Sets
• The Hexlite solver. Lightweight and efficient evaluation of HEX programs
• Exploiting unfounded sets for HEX-program evaluation
• Modular complexity analysis for term rewriting
• Modular analysis of executables using on-demand Heyting completion
• Program Complexity in Hierarchical Module Checking

Cited in

(6)

• Domain expansion for ASP-programs with external sources
• A model building framework for answer set programming with external computations
• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Finding explanations of inconsistency in multi-context systems
• FLP answer set semantics without circular justifications for general logic programs
• Exploiting unfounded sets for HEX-program evaluation

Describes a project that uses

Uses Software

• XSB

This page was built for publication: Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003246)