Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs

We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of the type hierarchy. We prove that there exists a bijection be...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory and practice of logic programming Jg. 18; H. 3-4; S. 421 - 437
Hauptverfasser:	CHARALAMBIDIS, ANGELOS, RONDOGIANNIS, PANOS, SYMEONIDOU, IOANNA
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.07.2018
Schlagworte:	Approximation Graphs Iterative methods Logic programming Logic programs Mathematical analysis Mathematical models Original Article Semantics Negation in Logic Programming Approximation Fixpoint Theory Higher-Order Logic Programming
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!