Prolog programming for artificial intelligence
Prolog programming for artificial intelligence
A logic-based calculus of events
New Generation Computing
Principles of artificial intelligence
Principles of artificial intelligence
Journal of Symbolic Computation
Proving Termination of General Prolog Programs
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A methodology for proving termination of general logic programs
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
Characterizations of Classes of Programs by Three-Valued Operators
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
On modular termination proofs of general logic programs
Theory and Practice of Logic Programming
Implementing type-based constructive negation
Proceedings of the 2007 ACM symposium on Applied computing
Termination prediction for general logic programs
Theory and Practice of Logic Programming
Hi-index | 0.00 |
Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's constructive negation, are based on termination conditions. This paper introduces a methodology for proving termination of general logic programs w.r.t, the Prolog selection rule. The idea is to distinguish parts of the program depending on whether or not their termination depends on the selection rule. To this end, the notions of low-, weakly up-, and up-acceptable program are introduced. We use these notions to develop a methodology for proving termination of general logic programs, and show how interesting problems in non-monotonic reasoning can be formalized and implemented by means of terminating general logic programs.