Transformation-based bottom-up computation of the well-founded model
From MaRDI portal
Publication:4452640
Recommendations
Cited in
(18)- Transformation-based bottom-up computation of the well-founded model
- Dealing with explicit preferences and uncertainty in answer set programming
- Efficient computation of the well-founded semantics over big data
- About epistemic negation and world views in epistemic logic programs
- Relating defeasible and normal logic programming through transformation properties.
- scientific article; zbMATH DE number 2090540 (Why is no real title available?)
- On the equivalence and range of applicability of graph-based representations of logic programs.
- On Signings and the Well-Founded Semantics
- Semantic-based construction of arguments: an answer set programming approach
- Parallel Logic Programming: A Sequel
- Preface
- Efficient Computation of the Well-Founded Model Using Update Propagation
- A general theory of confluent rewriting systems for logic programming and its applications
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
- A framework for goal-directed query evaluation with negation
- Justifications for logic programs under answer set semantics
- Approximating agreements in formal argumentation dialogues
- scientific article; zbMATH DE number 7453118 (Why is no real title available?)
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)