A framework for goal-directed query evaluation with negation

DOI10.1007/978-3-319-23264-5_14MaRDI QIDQ3449200zbMATH OpenOpenAlexFDO

Authors Stefan Brass

Publication date 4 November 2015

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23264-5_14

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Bottom-up evaluation and query optimization of well-founded models
• Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models
• Constructive negation under the well-founded semantics
• Efficient top-down computation of queries under the well-founded semantics
• An extension of Van Gelder's alternating fixpoint to magic programs

Cites work

• A goal-oriented approach to computing the well-founded semantics
• Characterizations of the stable semantics by partial evaluation
• scientific article; zbMATH DE number 1696854 (Why is no real title available?)
• On the power of magic
• Tabling for non-monotonic programming
• Transformation-based bottom-up computation of the well-founded model

This page was built for publication: A framework for goal-directed query evaluation with negation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449200)