A Dynamic Approach to Characterizing Termination of General Logic Programs

Details A Dynamic Approach to Characterizing Termination of General Logic Programs A Dynamic Approach to Characterizing Termination of General Logic Programs

2002-04-12

arxiv.org/abs/cs/0204031v1

ACM Transactions on Computational Logic 4(4):417-430, 2003

Computer Science

Logic in Computer Science

To appear in ACM TOCL

Scientific paper

We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a logic program, such as modes/types, norms/level mappings, models/interargument relations, and the like. We propose a dynamic approach which employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size. We also introduce a new formulation of SLDNF-trees, called generalized SLDNF-trees. Generalized SLDNF-trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs.

Affiliated with

Also associated with

No associations

Rating

A Dynamic Approach to Characterizing Termination of General Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Dynamic Approach to Characterizing Termination of General Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dynamic Approach to Characterizing Termination of General Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-667421