Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

DOI10.1007/978-3-642-20895-9_10zbMATH Open1327.68062DBLPconf/lpnmr/EiterFIKS11OpenAlexW1725632631WikidataQ57549102 ScholiaQ57549102MaRDI QIDQ3003246FDOQ3003246

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

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)

Cited In (6)

• Domain expansion for ASP-programs with external sources
• A model building framework for answer set programming with external computations
• Exploiting Unfounded Sets for HEX-Program Evaluation
• 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

Uses Software

• XSB

Recommendations

• The Hexlite solver. Lightweight and efficient evaluation of HEX programs 👍 👎
• Efficient HEX-Program Evaluation Based on Unfounded Sets 👍 👎
• Modular Complexity Analysis for Term Rewriting 👍 👎
• Program Complexity in Hierarchical Module Checking 👍 👎
• Exploiting Unfounded Sets for HEX-Program Evaluation 👍 👎
• Modular Analysis of Executables Using On-Demand Heyting Completion 👍 👎

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)