Modular Termination Proofs for Prolog with Tabling

Tabling avoids many of the shortcomings of SLD(NF) execution and provides a more flexible and efficient execution mechanism for logic programs. In particular, tabled execution of logic programs terminates more often than execution based on SLD-resolution. One of the few works studying termination un...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Verbaeten, Sofie, Sagonas, Konstantinos, De Schreye, Danny
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Level Mapping Logic Program Logic Programming Parse Tree Predicate Symbol Programming theory Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!