A Dynamic Approach to Characterizing Termination of General Logic Programs

Simple item page
dc.creatorShen, Yi-Dong
dc.creatorYou, Jia-Huai
dc.creatorYuan, Li-Yan
dc.creatorShen, Samuel S. P.
dc.creatorYang, Qiang
dc.date2002-04-12
dc.date.accessioned2026-07-07T03:18:18Z
dc.date.available2026-07-07T03:18:18Z
dc.descriptionWe 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.
dc.descriptionTo appear in ACM TOCL
dc.identifierhttps://arxiv.org/abs/cs/0204031
dc.identifierhttp://arxiv.org/abs/cs/0204031
dc.identifierACM Transactions on Computational Logic 4(4):417-430, 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31060
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectD.1.6;D.1.2;F.4.1
dc.titleA Dynamic Approach to Characterizing Termination of General Logic Programs
dc.typetext

Files

Collections

arXiv