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

Full description

Saved in:

Bibliographic Details
Published in:	arXiv.org
Main Authors:	Charalambidis, Angelos, Rondogiannis, Panos, Symeonidou, Ioanna
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 23.04.2018
Subjects:	Approximation Graphs Iterative methods Logic programming Logic programs Mathematical analysis Mathematical models Semantics
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!