Transformation-based bottom-up computation of the well-founded model
From MaRDI portal
Publication:4452640
DOI10.1017/S147106840100103XzbMATH Open1105.68322OpenAlexW1990606699MaRDI QIDQ4452640FDOQ4452640
Authors: J. Dix, Burkhard Freitag, Ulrich Zukowski, 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
Recommendations
Cited In (18)
- On the equivalence and range of applicability of graph-based representations of logic programs.
- Efficient computation of the well-founded semantics over big data
- Transformation-based bottom-up computation of the well-founded model
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
- Title not available (Why is that?)
- Relating defeasible and normal logic programming through transformation properties.
- Parallel Logic Programming: A Sequel
- On Signings and the Well-Founded Semantics
- A general theory of confluent rewriting systems for logic programming and its applications
- Dealing with explicit preferences and uncertainty in answer set programming
- About epistemic negation and world views in epistemic logic programs
- Semantic-based construction of arguments: an answer set programming approach
- Justifications for logic programs under answer set semantics
- Preface
- Title not available (Why is that?)
- Efficient Computation of the Well-Founded Model Using Update Propagation
- A framework for goal-directed query evaluation with negation
- Approximating agreements in formal argumentation dialogues
Uses Software
This page was built for publication: Transformation-based bottom-up computation of the well-founded model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452640)
