Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
From MaRDI portal
Publication:3003246
DOI10.1007/978-3-642-20895-9_10zbMath1327.68062OpenAlexW1725632631WikidataQ57549102 ScholiaQ57549102MaRDI QIDQ3003246
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
Related Items (5)
Exploiting Unfounded Sets for HEX-Program Evaluation ⋮ A model building framework for answer set programming with external computations ⋮ Finding explanations of inconsistency in multi-context systems ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Domain expansion for ASP-programs with external sources
Uses Software
This page was built for publication: Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
