Bibliography

1

Hassan Aït-Kaci.
Warren's Abstract Machine: A Tutorial Reconstruction.
MIT Press, 1991.

2

Ivan Bratko.
Prolog for Artificial Intelligence.
Addison-Wesley, 2000.

3

W.F. Clocksin and C.S. Mellish.
Programming in Prolog.
Springer-Verlag, 1994.

4

A. Colmerauer.
Equations and inequations on finite and infinite trees.
In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS-84), pages 85-99, Tokyo, Japan, 1984. ICOT.

5

Rina Dechter.
Constraint Processing.
Morgan Kaufmann Publishers, 2003.

6

Pascal Van Hentenryck.
Constraint Satisfaction in Logic Programming.
MIT Press, 1989.

7

Kim Marriott and Peter J. Stuckey.
Programming with Constraints: an Introduction.
MIT Press, 1998.

8

Richard A. O'Keefe.
The Craft of Prolog.
MIT Press, Cambridge, MA, USA, 1994.

9

Tom Schrijvers, Neng-Fa Zhou, and Bart Demoen.
Translating constraint handling rules into action rules.
In The Third Workshop on Constraint Handling Rules, 2006.

10

L. Sterling and E. Shapiro.
The Art of Prolog.
The MIT Press, 1997.

11

Hisao Tamaki and Taisuke Sato.
OLD resolution with tabulation.
In Ehud Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, pages 84-98, 1986.

12

E. Tsang.
Foundations of Constraint Satisfaction.
Academic Press, 1993.

13

D. S. Warren.
Memoing for logic programs.
Comm. of the ACM, Special Section on Logic Programming, 35:93-111, 1992.

14

Neng-Fa Zhou.
Parameter passing and control stack management in Prolog implementation revisited.
ACM Transactions on Programming Languages and Systems, 18(6):752-779, 1996.

15

Neng-Fa Zhou.
Programming finite-domain constraint propagators in action rules.
Theory and Practice of Logic Programming (TPLP), 2006.

16

Neng-Fa Zhou, Yi-Dong Shen, and Taisuke Sato.
Semi-naive evaluation in linear tabling.
In Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming, pages 90-97, 2004.