An abstract machine for efficiently computing queries to well-founded models

DOI10.1016/S0743-1066(00)00005-4MaRDI QIDQ4507851zbMATH OpenOpenAlexWikidataFDO

Authors K. Sagonas, Terrance Swift, David S. Warren

Publication date 10 October 2000

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(00)00005-4

zbMATH Keywords

well-founded semantics

Mathematics Subject Classification ID

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

Recommendations

• COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES
• Efficient top-down computation of queries under the well-founded semantics
• On well-founded models for logic programs
• scientific article; zbMATH DE number 1670504
• Abstract state machines and computationally complete query languages
• On generalized well-founded models for logic programs
• scientific article; zbMATH DE number 1302496
• scientific article; zbMATH DE number 4064541

Cited in

(9)

• Tabling for non-monotonic programming
• A three-valued semantics for querying and repairing inconsistent databases
• A new approach to hybrid probabilistic logic programs
• Incremental Tabling in Support of Knowledge Representation and Reasoning
• Efficient top-down computation of queries under the well-founded semantics
• Tabulated resolution for the well-founded semantics
• Tabled evaluation with delaying for general logic programs
• An abstract machine for fixed-order dynamically stratified programs
• Concurrent and Local Evaluation of Normal Programs

Describes a project that uses

Uses Software

• XSB
• Smodels

This page was built for publication: An abstract machine for efficiently computing queries to well-founded models

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