Efficient top-down computation of queries under the well-founded semantics

DOI10.1016/0743-1066(94)00028-5MaRDI QIDQ3125898zbMATH OpenOpenAlexFDO

Authors Weidong Chen, Terrance Swift, David S. Warren

Publication date 6 July 1997

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

Full work available at URL https://doi.org/10.1016/0743-1066(94)00028-5

zbMATH Keywords

logic programsrobust semantics

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
• scientific article; zbMATH DE number 1696828
• On the problem of computing the well-founded semantics
• An abstract machine for efficiently computing queries to well-founded models
• Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models

Cited in

(25)

• Safe computation of the well-founded semantics of datalog queries
• Top-down query processing in first-order deductive databases under the DWFS
• Transformation-based bottom-up computation of the well-founded model
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms
• A goal-oriented approach to computing the well-founded semantics
• Nonmonotonic trust management for P2P applications
• Dynamic reordering of alternatives for definite logic programs
• An abstract machine for efficiently computing queries to well-founded models
• Integrating answer set programming and constraint logic programming
• An abstract machine for fixed-order dynamically stratified programs
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• Compacting Boolean formulae for inference in probabilistic logic programming
• Computing the well-founded semantics faster
• Efficient bottom-up computation of queries on stratified databases
• A rule based knowledge transaction model for mobile environments
• Probabilistic reasoning with answer sets
• A framework for goal-directed query evaluation with negation
• Logic programming and knowledge representation---The A-Prolog perspective
• scientific article; zbMATH DE number 1696727 (Why is no real title available?)
• Logic programming with solution preferences
• Termination of logic programs with imperfect information: applications and query procedure
• Disjunctive logic and semantics of disjunctive logic programs
• A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
• Efficient and optimal query answering on independent schemes
• On the problem of computing the well-founded semantics

Describes a project that uses

Uses Software

• XSB

This page was built for publication: Efficient top-down computation of queries under the well-founded semantics

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