Transformation-based bottom-up computation of the well-founded model

DOI10.1017/S147106840100103XMaRDI QIDQ4452640zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

magic set transformationwell-founded semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Bottom-up evaluation and query optimization of well-founded models
• Efficient Computation of the Well-Founded Model Using Update Propagation
• On the problem of computing the well-founded semantics
• scientific article; zbMATH DE number 1696828
• Computing the well-founded semantics faster

Cited in

(21)

• State-saving transformations for efficient bottom-up evaluation of logic programs and rule-based systems
• On the equivalence and range of applicability of graph-based representations of logic programs.
• Relating defeasible and normal logic programming through transformation properties.
• Dealing with explicit preferences and uncertainty in answer set programming
• Efficient computation of the well-founded semantics over big data
• Efficient Computation of the Well-Founded Model Using Update Propagation
• A framework for goal-directed query evaluation with negation
• Justifications for logic programs under answer set semantics
• Preface
• scientific article; zbMATH DE number 2090540 (Why is no real title available?)
• Extended magic for negation: efficient demand-driven evaluation of stratified Datalog with precise complexity guarantees
• About epistemic negation and world views in epistemic logic programs
• Approximating agreements in formal argumentation dialogues
• A general theory of confluent rewriting systems for logic programming and its applications
• On Signings and the Well-Founded Semantics
• Parallel Logic Programming: A Sequel
• Transformation-based bottom-up computation of the well-founded model
• Bottom-up evaluation and query optimization of well-founded models
• On the foundations of grounding in answer set programming
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms
• Semantic-based construction of arguments: an answer set programming approach

Describes a project that uses

Uses Software

• XSB

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)