Efficient HEX-Program Evaluation Based on Unfounded Sets
From MaRDI portal
Publication:5404394
DOI10.1613/jair.4175zbMath1361.68031OpenAlexW2153361264WikidataQ129489692 ScholiaQ129489692MaRDI QIDQ5404394
Thomas Eiter, Thomas Krennwallner, Peter Schüller, Michael Fink, Christoph Redl
Publication date: 24 March 2014
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4175
Related Items (11)
Data repair of inconsistent nonmonotonic description logic programs ⋮ Exploiting Unfounded Sets for HEX-Program Evaluation ⋮ Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations ⋮ Rewriting recursive aggregates in answer set programming: back to monotonicity ⋮ Complexity and compilation of GZ-aggregates in answer set programming ⋮ A model building framework for answer set programming with external computations ⋮ The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description) ⋮ Hybrid planning for challenging construction problems: an answer set programming approach ⋮ Inlining External Sources in Answer Set Programs ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ Domain expansion for ASP-programs with external sources
This page was built for publication: Efficient HEX-Program Evaluation Based on Unfounded Sets
