On termination of general logic programs W.R.T. Constructive negation

Journal of Logic Programming

Volumn 26, Issue 1, 1996, Pages 69-89

  Marchiori, Elena ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROGRAMMING THEORY; PROLOG (PROGRAMMING LANGUAGE); QUERY LANGUAGES;

CONSTRUCTIVE NEGATION; NONMONOTONIC REASONING; PROGRAM TERMINATION;

LOGIC PROGRAMMING;

EID: 0029753434     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00090-9     Document Type: Article

References (14)

1. Apt, K. R., and Bezem, M., Acyclic programs, New Generation Computing 9:335-369 (1991).
2. Apt, K. R., and Doets, H. C., A new definition of SLDNF-resolution, The Journal of Logic Programming 18:177-190 (1994).
3. Apt, K. R., Marchiori, E., and Palamidessi, C., A declarative approach for first-order built-in's of Prolog, Applicable Algebra in Engineering, Communication and Computing 5(2, 4):151-191 (1994).
4. Apt, K. R., and Pedreschi, D., Proving termination of general Prolog programs, in: Proceedings of the Int. Conf. on Theoretical Aspects of Computer Software, no. 526 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991, pp. 265-289.
5. Bezem, M., Strong termination of logic programs, The Journal of Logic Programming 15:79-97 (1993).
6. Chan, D., Constructive negation based on the completed database in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, 1988, pp. 111-125.
7. Chan, D., An extension of constructive negation and its application in coroutining; in: Proceedings of the North American Conference on Logic Programming, 1989, pp. 477-493.
8. Davey, B. A., and Priestley, H. A., Introduction to Lattices and Order, Cambridge University Press, 1990.
9. De Schreye, D., and Decorte, S., Termination of logic programs: The never-ending story, The Journal of Logic Programming 19, 20:199-260 (1994).
10. Dershowitz, N., Termination of rewriting, Journal of Symbolic Computation 3:69-115 (1987).
11. Drabent, W., What is failure? An approach to constructive negation, Acta Informatica 32:27-59 (1995).
12. Hanks, S., and McDermott, D., Nonmonotonic logic and temporal reasoning, Artificial Intelligence 33:379-412 (1987).
13. Marchiori, E., A methodology for proving termination of general logic programs, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, (IJCAI-95), Montreal, 1995, pp. 356-361.
14. Stuckey, P. J., Constructive negation for constraint logic programming, in: Proceedings of the 6th Annual Symposium on Logic in Computer Science (LICS), Amsterdam, 1991, pp. 328-339.