Efficient top-down computation of queries under the well-founded semantics
From MaRDI portal
Publication:3125898
DOI10.1016/0743-1066(94)00028-5zbMATH Open0866.68017OpenAlexW2026433347MaRDI QIDQ3125898FDOQ3125898
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
Cited In (23)
- Safe computation of the well-founded semantics of datalog queries
- Transformation-based bottom-up computation of the well-founded model
- Top-down query processing in first-order deductive databases under the DWFS
- 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
- An abstract machine for fixed-order dynamically stratified programs
- Integrating answer set programming and constraint logic programming
- Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
- Efficient bottom-up computation of queries on stratified databases
- A rule based knowledge transaction model for mobile environments
- Probabilistic reasoning with answer sets
- Logic programming and knowledge representation---The A-Prolog perspective
- Compacting Boolean Formulae for Inference in Probabilistic Logic Programming
- Title not available (Why is that?)
- 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
- On the problem of computing the well-founded semantics
- Efficient and optimal query answering on independent schemes
Uses Software
Recommendations
- Bottom-up evaluation and query optimization of well-founded models π π
- Title not available (Why is that?) π π
- 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 π π
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)