Tabulated resolution for the well-founded semantics

Journal of Logic Programming

Volumn 34, Issue 2, 1998, Pages 67-109

  Bol, Roland ^a   Degerstedt, Lars ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b SoftLab InfoSystem AB   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTERS; MATHEMATICAL TECHNIQUES; PROGRAMMING THEORY;

TABULATED RESOLUTION;

LOGIC PROGRAMMING;

EID: 0031999231     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)00073-3     Document Type: Article

References (29)

1. Alferes, J. J., Damásio, C. V., and Pereira, L. M., A Top-Down Derivation Procedure for Programs with Explicit Negation, in: M. Bruynooghe (ed.), Proc. Int. Logic Programming Symp., Ithaca, MIT Press, Cambridge, MA, 1994.
2. Apt, K., Introduction to Logic Programming, in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science: Formal Models and Semantics, Elsevier, New York, 1990, Vol. B, pp. 493-574.
3. Bidoit, N. and Froidevaux, C., Negation by Default and Unstratifiable Logic Programs, J. Theoret. Comput. Sci. 78:85-112(1991).
4. Bol, R., Loop Checking and Negation, J. Logic Programming 15:147-175 (1993).
5. Bol, R. and Degerstedt, L., The Underlying Search for Magic Templates and Tabulation, in: D. Warren (ed.), Proc. Tenth Int. Conf. Logic Programming, Budapest, MIT Press, Cambridge, MA, 1993 (long version in Technical Report LiTH-IDA-R-93-01, IDA, Linkoping University).
6. Bonnier, S., Nilsson, U., and Näslund, T., A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics, Inform. Processing Lett. 40:73-78 (1991).
7. Chen, W., Swift, T., and Warren, D. S., Efficient Top-Down Computation of Queries under the Well-Founded Semantics, J. Logic Programming 24:161-199 (1995).
8. Chen, W. and Warren, D. S., A Goal-Oriented Approach to Computing Well-Founded Semantics, in: K. R. Apt (ed.), Proc. Joint Int. Conf. Symp. Logic Programming, Washington, DC, ALP, IEEE, MIT Press, Cambridge, MA, 1992, pp. 589-603.
9. Chen, W. and Warren, D. S., A Query Evaluation under the Well-Founded Semantics, in: Proc. Twelfth ACM SIGACT-SIGMOD-SIGART Symp. Principles Database Syst., Washington, DC, ACM Press, 1993, pp. 168-179.
10. Clark, K., Negation as Failure, in: H. Gallaire and J. Minker (eds.), Logic and Databases, Plenum, New York, 1978.
11. Damásio, C. V., Paraconsistent Extended Logic Programming with Constraints, Ph.D. Thesis, New Lisbon University, Lisbon, Portugal, 1996.
12. Degerstedt, L., Tabulated Resolution for Well-Founded Semantics, Licentiate Thesis no. 402, Department of Computer and Information Science, Linköping University, Linköping, Sweden, 1993.
13. Degerstedt, L., Tabulation-Based Logic Programming: A Multi-Level View of Query Answering, Ph.D. Thesis, no. 462, Linkoping University, Linköping, Sweden, 1996.
14. Degerstedt, L. and Nilsson, U., Magic Computation for Well-Founded Semantics, in: J. Dix, L. M. Pereira, and T. Przymusinski (eds.), Non-Monotonic Extensions of Logic Programming, LNAI 927, Springer Verlag, Berlin, 1995, pp. 181-204.
15. Kemp, D., Stuckey, P., and Srivastava, D., Query Restricted Bottom-Up Evaluation of Normal Logic Programs, in: K. Apt (ed.), Proc. Joint Int. Conf. Symp. Logic Programming, Washington, DC, MIT Press, Cambridge, MA, 1992, pp. 288-302.
16. Komorowski, J., A Specification of an Abstract Prolog Machine and Its Application to Partial Evaluation, Ph.D. Thesis, Linkoping Studies in Science and Technology Dissertations 69, Linköping University, Linköping, Sweden, 1981.
17. Komorowski, J., A Prolegomenon to Partial Deduction, Fundamenta Informaticae 41-64 (1993).
18. Lloyd, J. W., Foundations of Logic Programming, 2nd extended edition, Springer-Verlag, Berlin, 1987.
19. Lloyd, J. W. and Sheperdson, J. C., Partial Evaluation in Logic Programming, J. Logic Programming 11:217-242 (1991).
20. Pereira, L. M., Alferes, J. J., and Aparicio, J. N., Derivation Procedures for Extended Stable Models, in: Twelvth Int. Joint Conf. Artif. Intell., Sydney, Morgan Kaufmann Publishers, San Mateo, CA, 1991, pp. 863-868.
21. Periera, F. and Warren, D. H. D., Parsing as Deduction, in: Proc. Assoc. Computat. Linguistics, 21th Ann. Meeting, 1983, pp. 137-144.
22. Przymusinska, H., Przymusinski, T. C., and Seki, H., Soundness and Completeness of Partial Deductions for Well-Founded Semantics, in: Proc. Conf. Automated Reasoning, 1992.
23. Przymusinski, T. C., Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model, in: Proc. 8th Symp. Principles Database Syst., ACM SIGACT-SIGMOD, 1989, pp. 11-21.
24. Ramakrishnan, R., Magic Templates: A Spellbinding Approach to Logic Programs, J. Logic Programming 11:189-216 (1991).
25. Ross, K., A Procedural Semantics for Well-Founded Negation in Logic Programs, J. Logic Programming 13:1-22 (1992).
26. Seki, H. and Itoh, H., A Query Evaluation Method for Stratified Programs under the Extended CWA, in: R. A. Kowalski and K. A. Bowen (eds.), Proc. Fifth Int. Conf. Symp. Logic Programming, Seattle, ALP, IEEE, MIT Press, Cambridge, MA, 1988, pp. 195-211.
27. Tamaki, H. and Sato, T., OLD Resolution with Tabulation, in: E. Shapiro (ed.), Proc. Third Int. Conf. Logic Programming, London, Lecture Notes in Computer Science 225, Springer Verlag, Berlin, 1986, pp. 84-98.
28. van Gelder, A. v., Ross, K., and Schlipf, J., The Well-Founded Semantics for General Logic Programs, J. ACM 38:620-650 (1991).
29. Vieille, L., Recursive Query Processing: The Power of Logic, Theoret. Comput. Sci. 69:1-53 (1989).