Transformation-based bottom-up computation of the well-founded model
From MaRDI portal
Publication:4452640
DOI10.1017/S147106840100103XzbMath1105.68322OpenAlexW1990606699MaRDI QIDQ4452640
Ulrich Zukowski, Jürgen Dix, Burkhard Freitag, Stefan Brass
Publication date: 1 March 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s147106840100103x
Related Items (15)
A Framework for Goal-Directed Query Evaluation with Negation ⋮ Efficient Computation of the Well-Founded Semantics over Big Data ⋮ Dealing with explicit preferences and uncertainty in answer set programming ⋮ On Signings and the Well-Founded Semantics ⋮ Parallel Logic Programming: A Sequel ⋮ About Epistemic Negation and World Views in Epistemic Logic Programs ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ Unnamed Item ⋮ Approximating agreements in formal argumentation dialogues1 ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ Justifications for logic programs under answer set semantics ⋮ Preface ⋮ On the equivalence and range of applicability of graph-based representations of logic programs. ⋮ Relating defeasible and normal logic programming through transformation properties.
Uses Software
This page was built for publication: Transformation-based bottom-up computation of the well-founded model
