The finiteness of logic programming derivations

The finiteness of logic programming derivations

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-e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Balbiani, Philippe
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computer Science
Logic in Computer Science
Logic Program
Logic Programming
Modal Logic
Predicate Symbol
Variable Assignment
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0013840