Modular termination proofs for logic and pure Prolog programs

Modular termination proofs for logic and pure Prolog programs

Weitere Versionen anzeigen (1)

Abstract: "We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Apt, Krzysztof R. 1949- (VerfasserIn), Pedreschi, Dino (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Amsterdam 1993
Schriftenreihe:Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,16
Schlagworte:
Logic programming
Prolog (Computer program language)
Proof theory
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Abstract: "We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they can be used in a modular way."
Beschreibung:35 S.

Ähnliche Einträge