Bibliography

1

H. Ait-Kaci.
The WAM: a (real) tutorial.
Technical Report 5, DEC Paris Research Report, 1990.

2

J. Alferes, C. Damasio, and L. Pereira.
SLX: a top-down derivation procedure for programs with explicit negation.
In M. Bruynooghe, editor, International Logic Programming Symp, pages 424-439, 1994.

3

J. Alferes, C. Damasio, and L. Pereira.
A logic programming system for non-monotonic reasoning.
Journal of Automated Reasoning, 1995.

4

F. Banchilhon, D. Maier, Y. Sagiv, and J. Ullman.
Magic sets and other strange ways to implement logic programs.
In PODS. ACM, 1986.

5

C. Beeri and R. Ramakrishnan.
On the power of magic.
J. Logic Programming, 10(3):255-299, 1991.

6

A. Bonner and M. Kifer.
An overview of transaction logic.
Theoretical Computer Science, 133:205-265, October 1994.

7

D. Boulanger.
Fine-grained goal-directed declarative analysis of logic programs.
Proceedings of the International Workshop on Verification, Model Checking and Abstract Interpretation, 1997.
Available through http://www.dsi.unive.it/ bossi/VMCAI.html.

8

L. Castro and V. S. Costa.
Understanding memory management in prolog systems.
In International Conference on Logic Programming, number 2237 in LNCS, pages 11-26. Springer, 2001.

9

L. Castro, T. Swift, and D. Warren.
Suspending and resuming computations in engines for SLG evaluation.
In Practical Applications of Declarative Languages, 2002.
To appear.

10

W. Chen, M. Kifer, and D. S. Warren.
HiLog: A foundation for higher-order logic programming.
J. Logic Programming, 15(3):187-230, 1993.

11

W. Chen, T. Swift, and D. S. Warren.
Efficient top-down computation of queries under the well-founded semantics.
J. Logic Programming, 24(3):161-199, September 1995.

12

W. Chen and D. S. Warren.
Tabled Evaluation with Delaying for General Logic Programs.
Journal of the ACM, 43(1):20-74, January 1996.

13

M. Codish, B. Demoen, and K. Sagonas.
Semantics-based program analysis for logic-based languages using XSB.
Springer International Journal of Software Tools for Technology Transfer, 2(1):29-45, Nov. 1998.

14

B. Cui and T. Swift.
Preference logic grammars: Fixed-point semantics and application to data standardization.
Artificial Intelligence, 2001.
To Appear. Preliminary version appeared in Conference on Logic Programming and Non-Monotonic Reasoning, 1999, Springer-Verlag LNAI 1730.

15

B. Cui, T. Swift, and D. S. Warren.
From tabling to transformation: Implementing non-ground residual programs.
In International Workshop on Implementations of Declarative Languages, 1999.

16

S. Dawson, C. R. Ramakrishnan, S. Skiena, and T. Swift.
Principles and practice of unification factoring.
ACM Transactions on Programming Languages and Systems, September 1996.

17

S. Dawson, C. R. Ramakrishnan, and D. S. Warren.
Practical program analysis using general purpose logic programming systems -- a case study.
In ACM PLDI, pages 117-126, May 1996.

18

S. Debray.
SB-Prolog System, Version 3.0, A User Manual, 1988.

19

B. Demoen and K. Sagonas.
CAT: the Copying Approach to Tabling.
In Priniclpes of Declarative Programming, 10th International Symposium, pages 21-35. Springer-Verlag, 1998.
LNCS 1490.

20

B. Demoen and K. Sagonas.
Memory Management for Prolog with Tabling.
In Proceedings of ISMM'98: ACM SIGPLAN International Symposium on Memory Management, pages 97-106. ACM Press, 1998.

21

S. Dietrich.
Extension Tables for Recursive Query Evaluation.
PhD thesis, SUNY at Stony Brook, 1987.

22

J. Freire, T. Swift, and D. Warren.
Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies.
Journal of Functional and Logic Programming, 1998.

23

J. Freire, T. Swift, and D. Warren.
A formal framework for scheduling in SLG.
In International Workshop on Tabling in Parsing and Deduction, 1998.

24

J. Gartner, T. Swift, A. Tien, L. M. Pereira, and C. Damásio.
Psychiatric diagnosis from the viewpoint of computational logic.
In International Conference on Computational Logic, pages 1362-1376. Springer-Verlag, 2000.
LNAI 1861.

25

ISO working group JTC1/SC22.
Prolog international standard.
Technical report, International Standards Organization, 1995.

26

E. Johnson, C. R. Ramakrishnan, I. V. Ramakrishnan, and P. Rao.
A space efficient engine for subsumption-based tabled evaluation of logic programs.
In A. Middeldorp and T. Sato, editors, 4th Fuji International Symposium on Functional and Logic Programming, number 1722 in Lecture Notes in Computer Science, pages 284-299. Springer-Verlag, Nov. 1999.

27

D. Kemp and R. Topor.
Completeness of a top-down query evaluation procedure for stratified databases.
In Logic Programming: Proc. of the Fifth International Conference and Symposium, pages 178-194, 1988.

28

M. Kifer, G. Lausen, and J. Wu.
Logical foundations of object-oriented and frame-based languages.
Journal of the ACM, 42:741-843, July 1995.

29

M. Kifer and V. S. Subrahmanian.
Theory of generalized annotated logic programming and its applications.
J. Logic Programming, 12(4):335-368, 1992.

30

R. Larson, D. S. Warren, J. Freire, and K. Sagonas.
Syntactica.
MIT Press, 1995.

31

R. Larson, D. S. Warren, J. Freire, K. Sagonas, and P. Gomez.
Semantica.
MIT Press, 1996.

32

J. Leite and L. M. Pereira.
Iterated logic programming updates.
In International Conference on Logic Programming, pages 265-278. MIT Press, 1998.

33

T. Lindholm and R. O'Keefe.
Efficient implementation of a defensible semantics for dynamic PROLOG code.
In Proceedings of the International Conference on Logic Programming, pages 21-39, 1987.

34

X. Liu, C. R. Ramakrishnan, and S. Smolka.
Fully local and efficient evaluation of alternating fixed points.
In TACAS 98: Tools and Algorithms for Construction and Analysis of Systems, pages 5-19. Springer-Verlag, 1998.

35

J. W. Lloyd.
Foundations of Logic Programming.
Springer-Verlag, 1984.

36

I. Niemelä and P. Simons.
SModels -- An implementation of the stable model and well-founded semantics for normal LP.
In International Conference on Logic Programming and Non-Monotonic Reasoning, pages 420-429. Springer-Verlag, 1997.

37

T. Przymusinski.
Every logic program has a natural stratification and an iterated least fixed point model.
In PODS, pages 11-21, 1989.

38

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 of CAV 97, 1997.

39

P. Rao, I. V. Ramakrishnan, K. Sagonas, T. Swift, and D. S. Warren.
Efficient table access mechanisms for logic programs.
Journal of Logic Programming, 38(1):31-54, Jan. 1999.

40

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.

41

K. Sagonas, T. Swift, and D. S. Warren.
XSB as an efficient deductive database engine.
In Proc. of SIGMOD 1994 Conference. ACM, 1994.

42

K. Sagonas, T. Swift, and D. S. Warren.
An abstract machine for efficiently computing queries to well-founded models.
Journal of Logic Programming, 45(1-3):1-41, 2000.

43

K. Sagonas, T. Swift, and D. S. Warren.
The limits of fixed-order computation.
Theoretical Computer Science, 254(1-2):465-499, 2000.

44

K. Sagonas and D. S. Warren.
Efficient execution of HiLog in WAM-based Prolog implementations.
In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 349-363. MIT Press, June 1995.

45

H. Seki.
On the power of Alexandrer templates.
In Proc. of 8th PODS, pages 150-159. ACM, 1989.

46

T. Swift.
A new formulation of tabled resolution with delay.
In Recent Advances in Artifiial Intelligence. Springer-Verlag, 1999.
Available at http://www.cs.sunysb.edu/ $\tilde{\ }$tswift.

47

T. Swift.
Tabling for non-monotonic programming.
Annals of Mathematics and Artificial Intelligence, 25(3-4):201-240, 1999.

48

H. Tamaki and T. Sato.
OLDT resolution with tabulation.
In Third International Conference on Logic Programming, pages 84-98, 1986.

49

A. van Gelder, K. Ross, and J. Schlipf.
Unfounded sets and well-founded semantics for general logic programs.
JACM, 38(3):620-650, 1991.

50

L. Vieille.
Recursive query processing: The power of logic.
Theoretical Computer Science, 69:1-53, 1989.

51

A. Walker.
Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete.
J. Automated Reasoning, 11(1):1-23, 1993.
Originally formulated in New York University TR 34, 1981.

52

D. H. D. Warren.
An abstract Prolog instruction set.
Technical Report 309, SRI, 1983.

53

J. Xu.
The PSB-Prolog User Manual, 1990.