SLT-resolution for the well-founded semantics

Journal of Automated Reasoning

Volumn 28, Issue 1, 2002, Pages 53-97

  Shen, Yi Dong ^a   Yuan, Li Yan ^b   You, Jia Huai ^b  

^a CHONGQING UNIVERSITY   (China)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Global SLS resolution; Linear tabling; Procedural semantics; SLG resolution; SLT resolution; Well founded semantics

Indexed keywords

COMPUTATIONAL COMPLEXITY; LOGIC PROGRAMMING; MATHEMATICAL OPERATORS; POLYNOMIALS; PROLOG (PROGRAMMING LANGUAGE); QUERY LANGUAGES;

LINEAR TABLING; PROCEDURAL SEMANTICS; WELL-FOUNDED SEMANTICS;

SEMANTICS;

EID: 0036158644     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020116927466     Document Type: Article

References (38)

1. Contributions to the theory of logic programming
2. An analysis of loop checking mechanisms for logic programs
3. The underlying search for magic templates and tabulation
4. Tabulated resolution for the well-founded semantics
5. Constructive negation based on the completed database
6. Efficient top-down computation of queries under the well-founded semantics
7. Tabled evaluation with delaying for general logic programs
8. Negation as failure
9. Termination of logic programs: The never-ending story
10. What is failure? An approach to constructive negation
11. The stable model semantics for logic programming
12. Linear resolution with selection functions
13. Predicate logic as a programming language
14. Constructive negation under the well-founded semantics
15. On the declarative and procedural semantics of logic programs
16. Every logic program has a natural stratification and an iterated fixed point model
17. On constructive negation in logic programming
18. The well-founded semantics coincides with the three-valued stable semantics
19. A machine-oriented logic based on the resolution principle
20. A procedural semantics for well-founded negation in logic programs
21. XSB as an efficient deductive database engine
22. An abstract machine for tabled execution of fixed-order stratified logic programs
23. An extended variant of atoms loop check for positive logic programs
24. Linear tabulated resolution based on prolog control strategy
25. Linear tabulated resolution for the well founded semantics
26. Negation in logic programming
27. OLD resolution with tabulation
28. The semantics of predicate logic as a programming language
29. Negation as failure using tight derivations for general logic programs
30. The well-founded semantics for general logic programs
31. The complexity of relational query languages
32. Recursive query processing: The power of logic
33. An abstract prolog instruction set
34. Memoing for logic programs
35. Parameter passing and control stack management in Prolog implementation revisited