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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theory and practice of logic programming Ročník 18; číslo 3-4; s. 421 - 437
Hlavní autori:	CHARALAMBIDIS, ANGELOS, RONDOGIANNIS, PANOS, SYMEONIDOU, IOANNA
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.07.2018
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!