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

by   Angelos Charalambidis, et al.
NCSR Demokritos
University of Athens

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 between such Fitting-monotonic functions and pairs of two-valued-result functions where the first member of the pair is monotone-antimonotone and the second member is antimonotone-monotone. By deriving an extension of consistent approximation fixpoint theory (Denecker et al. 2004) and utilizing the above bijection, we define an iterative procedure that produces for any given higher-order logic program a distinguished extensional model. We demonstrate that this model is actually a minimal one. Moreover, we prove that our construction generalizes the familiar well-founded semantics for classical logic programs, making in this way our proposal an appealing formulation for capturing the well-founded semantics for higher-order logic programs. This paper is under consideration for acceptance in TPLP.


page 1

page 2

page 3

page 4


The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs

In (Bezem 1999; Bezem 2001), M. Bezem defined an extensional semantics f...

The Unfolding Semantics of Functional Programs

The idea of using unfolding as a way of computing a program semantics ha...

Fixpoint 3-valued semantics for autoepistemic logic

The paper presents a constructive fixpoint semantics for autoepistemic l...

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation

Extensional higher-order logic programming has been introduced as a gene...

Fixpoint Semantics and Optimization of Recursive Datalog Programs with Aggregates

A very desirable Datalog extension investigated by many researchers in t...

Extensional Higher-Order Logic Programming

We propose a purely extensional semantics for higher-order logic program...

Please sign up or login with your details

Forgot password? Click here to reset