The finiteness of logic programming derivations - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 1992

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.
Fichier principal
Vignette du fichier
Balbiani1992_Chapter_TheFinitenessOfLogicProgrammin (1).pdf (1.7 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03252315 , version 1 (07-06-2021)

Identifiants

Citer

Philippe Balbiani. The finiteness of logic programming derivations. 3rd International Conference on Algebraic and Logic Programming (ALP 1992), Sep 1992, Volterra, Italy. pp.403-419, ⟨10.1007/BFb0013840⟩. ⟨hal-03252315⟩
28 Consultations
42 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More