The finiteness of logic programming derivations
Résumé
The question of the termination of logic programming computations is studied from a semantical point of view. To every program are associated two first-order formulas. Their valid consequences are respectively the finiteness and the infiniteness SLDNF sets of the logic programs considered. The non-existence of a recursive safe computation rule leading into an infinite SLDNF computation is proved.
Domaines
Logique en informatique [cs.LO]
Fichier principal
Balbiani1992_Chapter_TheFinitenessOfLogicProgrammin (1).pdf (1.7 Mo)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)