|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
K. R. Apt and K. Doets. A new de~nition of SLDNF-resolution. Journal of Logic Programming, 18(2):177{190, February 1994.
|
 |
2
|
|
| |
3
|
K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293{322. Plenum Press, 1978.
|
| |
4
|
A. Colmerauer. Equations and inequations on ~nite and in~nite trees. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 85{99, Tokyo, Japan, Nov. 1984. OHMSHA Ltd. Tokyo and North-Holland.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
M. Denecker and D. De Schreye. Terms in logic programs: a problem with their semantics and its e~ect on the programming methodology. The Journal for the Integrated Study of Arti~cial Intelligence, Cognitive Science and Applied Epistemology, 7(3-4):363{383, 1990.
|
| |
9
|
M. Denecker and D. De Schreye. SLDNFA: an abductive procedure for abductive logic programs. Journal of Logic Programming, 34(2):111{167, Feb. 1998.
|
| |
10
|
M. Dincbas, H. Simonis, and P. V.Hentenryck. Solving a cutting-stock problem in constraint logic programming. In R. A. Kowalski and K. A. Bowen, editors, Logic Programming, Proceedings of the Fifth International Conference and Symposium, pages 42{58, Seattle, Washington, Aug. 1988. MIT Press.
|
| |
11
|
K. Eshghi. Abductive planning with event calculus. In R. Kowalski and K. Bowen, editors, Proc. of the International Conference onLogic Programming, pages 562{579. The MIT press, 1988.
|
| |
12
|
M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2(4):295{312, 1985.
|
| |
13
|
T. F. Fung and R. A. Kowalski. The i~ proof procedure for abductive logic programming. Journal of Logic Programming, 33(2):151{165, November 1997.
|
| |
14
|
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. A. Kowalski and K. A. Bowen, editors, Logic Programming, Proc. Fifth Int. Conf. and Symp. (IJCSLP'88, pages 1070{1080. MIT Press, 1988.
|
| |
15
|
|
| |
16
|
M. H?ohfeld and G. Smolka. De~nite relations over constraint languages. LILOG Report 53, IWBS, IBM Deutschland, Oct. 1988.
|
| |
17
|
|
| |
18
|
J. Ja~ar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic programming, 19-20:503{581, 1994.
|
| |
19
|
A. Kakas, R. Kowalski, and F. Toni. The role of abduction in logic programming. In D. M. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Arti~cial Intelligence and Programming 5, pages 235{324. Oxford University Press, 1998.
|
| |
20
|
A. C. Kakas and P. Mancarella. Generalized stable models: A semantics for abduction. In Proceedings of the 9th ECAI, pages 385{391, Stockholm, Sweden, Aug. 1990.
|
| |
21
|
A. C. Kakas and A. Michael. Integrating abductive and constraint logic programming. In L. Sterling, editor, Proceedings of the 12th International Conference onLogic Programming, pages 399{413. Tokyo, Japan, MIT Press, 1995.
|
| |
22
|
A. C. Kakas, A. Michael, and C. Mourlas. ACLP: Abductive constraint logic programming. Journal of Logic programming, 44(1{3):129{177, 2000. Special issue Abductive Logic Programming.
|
| |
23
|
|
| |
24
|
|
| |
25
|
V. Lifschitz. Action languages, answer sets, and planning. In K. Apt, V. W. Marek, M. Truszczy~ nski, and D. Warren, editors, The Logic Programming Paradigm: a 25Years Perspective, pages 357{373. Springer-Verlag, 1999.
|
| |
26
|
|
| |
27
|
V. M. Marek and M. Truszczy~ nski. Stable models and an alternative logic programming paradigm. In K. Apt, V. W. Marek, M. Truszczy~ nski, and D. Warren, editors, The Logic Programming Paradigm: a 25 Years Perspective, pages 375{398. Springer-Verlag, 1999.
|
| |
28
|
I. Niemel?a. Logic programs with stable model sematics as a constraint programming paradigm. In Proc. of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72{79, 1998.
|
| |
29
|
I. Niemel?a and P. Simons. E~cient implementation of the well-founded and stable model semantics. In M. Maher, editor, Logic Programming, Proc. 1996 Joint Int. Conf. and Symp. on Logic Programming (JICLP'96), pages 289{303. MIT Press, 1996.
|
| |
30
|
N. Pelov, E. De Mot, and M. Bruynooghe. A comparison of logic programming approaches for representation and solving of constraint satisfaction problems. In M. Denecker, A. Kakas, and F. Toni, editors, 8th International Workshop on Non-Monotonic Reasoning, Special Session on Abduction, Breckenridge, Colorado, USA, Apr. 2000.
|
| |
31
|
Konstantinos Sagonas , Terrance Swift , David S. Warren, XSB as an efficient deductive database engine, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.442-453, May 24-27, 1994, Minneapolis, Minnesota, United States
|
| |
32
|
P. J. Stuckey. Constructive negation for constraint logic programming. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 328{339, Amsterdam, The Netherlands, July 1991. IEEE Computer Society Press.
|
| |
33
|
E. Tsang. Foundations of Constraint Satisfaction. Computation in Cognitive Science. Academic Press, 1993.
|
| |
34
|
|
| |
35
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
I.2