Termination of General Logic Programs

Title: Termination of General Logic Programs

Research Question: How can we develop a dynamic approach to characterize the termination of general logic programs?

Methodology: The researchers proposed a dynamic approach to termination analysis of general logic programs. They introduced a new formulation of SLDNF-trees, called generalized SLDNF-trees. These trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs.

Results: They presented a new characterization of termination of general logic programs. Their approach employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size.

Implications: This research has significant implications for the field of logic programming. It provides a new, dynamic approach to termination analysis that goes beyond the static approaches that rely on modes/types, norms/level mappings, models/interargument relations, and the like. This could lead to more accurate and efficient termination analysis for general logic programs.

Link to Article: https://arxiv.org/abs/0204031v1 Authors: arXiv ID: 0204031v1