Enhancing global SLS-resolution with loop cutting and tabling mechanisms
From MaRDI portal
Publication:703484
DOI10.1016/j.tcs.2004.07.028zbMath1071.68019OpenAlexW2026582799MaRDI QIDQ703484
Jia-Huai You, Yi-Dong Shen, Li Yan Yuan
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.028
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bottom-up evaluation and query optimization of well-founded models
- An analysis of loop checking mechanisms for logic programs
- Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
- SLT-resolution for the well-founded semantics
- An extension of Van Gelder's alternating fixpoint to magic programs
- Tabling for non-monotonic programming
- Efficient top-down computation of queries under the well-founded semantics
- Negation as failure using tight derivations for general logic programs
- Tabulated resolution for the well-founded semantics
- A procedural semantics for well-founded negation in logic programs
- The well-founded semantics for general logic programs
- Termination of logic programs: the never-ending story
- Tabled evaluation with delaying for general logic programs
- Linear tabulated resolution based on Prolog control strategy
- Transformation-based bottom-up computation of the well-founded model
- On the problem of computing the well-founded semantics
- A dynamic approach to characterizing termination of general logic programs
- A Machine-Oriented Logic Based on the Resolution Principle
- On the equivalence of the static and disjunctive well-founded semantics and its computation
This page was built for publication: Enhancing global SLS-resolution with loop cutting and tabling mechanisms
