A new formulation of tabled resolution with delay

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1695, Issue , 1999, Pages 163-177

  Swift, Terrance ^a  

^a Stony Brook University   (United States)

Author keywords

Logic programming; Non Monotonic reasoning

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; FORESTRY; MODEL CHECKING; PARAMETERIZATION; RECONFIGURABLE HARDWARE;

EQUIVALENCE TO; NEW APPLICATIONS; NON-MONOTONIC REASONING; PARAMETERIZED; PRACTICAL USE; SUBSUMPTION RELATION; TABLED RESOLUTION; WELL-FOUNDED MODELS;

LOGIC PROGRAMMING;

EID: 84957697212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48159-1_12     Document Type: Conference Paper

References (20)

1. J. Alferes, L. M. Pereira, and T. Swift. Well-founded abduction via tabling dual programs. Technical report, SUNY Stony Brook, 1999.
2. R. Bol and L. Degerstedt. Tabulated resolution for well-founded semantics. Journal of Logic Programming, 38(1):31-55, February 1998.
3. W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. JACM, 43(1):20-74, January 1996.
4. C. Damásio. Paraconsistent Extended Logic Programming with Constraints. PhD thesis, Univ. Nova de Lisboa, 1996.
5. C. Damásio, W. Nejdl, L. M. Pereira, and M. Schroeder. Model-based diagnosis preferences and strategies representation with logic meta-programming. In Metalogics and Logic Programming, pages 269-311, 1995.
6. K. Devlin. Fundamentals of Contemporary Set Theory. Springer-Verlag, Berlin Germany, 1980.
7. J. Freire, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. XSB: A system for efficiently computing the well-founded semantics. In LPNMR, pages 430-440. MIT Press, 1997.
8. J. Freire, T. Swift, and D. S. Warren. Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies. Journal of Functional and Logic Programming, 1998(3), 1998.
9. R. Hu. Distributed Tabled Evaluation. PhD thesis, SUNY at Stony Brook, 1997.
10. J. Liu, L. Adams, and W. Chen. Constructive negation under the well-founded semantics. Technical report, SMU, 1996.
11. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin Germany, 1984.
12. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings on the Conference on Automated Verification, pages 143-154, 1997.
13. R. Ramakrishnan, C. Beeri, and R. Krishnamurthi. Optimizing existential datalog queries. In Proc. of the ACM Symposium on Principles of Database Systems, pages 89-102. ACM, 1988.
14. K. Sagonas and T. Swift. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM TOPLAS, 20(3):586-635, May 1998.
15. K. Sagonas, T. Swift, and D. S. Warren. An abstract machine for computing the well-founded semantics. Extended version of article in Joint International Conference and Symposium on Logic Programming, 1996, pp. 274-289, MIT Press.
16. K. Sagonas, T. Swift, and D. S. Warren. The limits of fixed-order computation. Theoretical Computer Science, 1999. To apperar. Preliminary version apeared in International Workshop on Logic and Databases, LNCS.
17. T. Swift. Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence. To appear.
18. H. Tamaki and T. Sato. OLDT resolution with tabulation. In ICLP, pages 84-98. Springer-Verlag, 1986.
19. A. van Gelder, K.A. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. JACM, 38(3):620-650, 1991.
20. U. Zukowski, S. Brass, and B. Freitag. Improving the alternating fixpoint: The transformation approach. In LPNMR, pages 40-59. Springer-Verlag, 1997.