Verifying Termination of General Logic Programs with Concrete Queries

Details Verifying Termination of General Logic Programs with Concrete Queries Verifying Termination of General Logic Programs with Concrete Queries

2000-06-21

arxiv.org/abs/cs/0006031v1

Computer Science

Artificial Intelligence

28 pages, 8 figures

Scientific paper

We introduce a method of verifying termination of logic programs with respect to concrete queries (instead of abstract query patterns). A necessary and sufficient condition is established and an algorithm for automatic verification is developed. In contrast to existing query pattern-based approaches, our method has the following features: (1) It applies to all general logic programs with non-floundering queries. (2) It is very easy to automate because it does not need to search for a level mapping or a model, nor does it need to compute an interargument relation based on additional mode or type information. (3) It bridges termination analysis with loop checking, the two problems that have been studied separately in the past despite their close technical relation with each other.

Affiliated with

Also associated with

No associations

Rating

Verifying Termination of General Logic Programs with Concrete Queries 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 Verifying Termination of General Logic Programs with Concrete Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verifying Termination of General Logic Programs with Concrete Queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-22761