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

by   Angelos Charalambidis, et al.

Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we consider the semantics of negation in the context of the new paradigm. Using some recent results from non-monotonic fixed-point theory, we demonstrate that every higher-order logic program with negation has a unique minimum infinite-valued model. In this way we obtain the first purely model-theoretic semantics for negation in extensional higher-order logic programming. Using our approach, we resolve an old paradox that was introduced by W. W. Wadge in order to demonstrate the semantic difficulties of higher-order logic programming.


page 1

page 2

page 3

page 4


Extensional Higher-Order Logic Programming

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

Topos Semantics for a Higher-Order Temporal Logic of Actions

TLA is a popular temporal logic for writing stuttering-invariant specifi...

A Survey of the Proof-Theoretic Foundations of Logic Programming

Several formal systems, such as resolution and minimal model semantics, ...

Linear Models of Computation and Program Learning

We consider two classes of computations which admit taking linear combin...

The Expressive Power of Higher-Order Datalog

A classical result in descriptive complexity theory states that Datalog ...

Higher Order Programming to Mine Knowledge for a Modern Medical Expert System

Knowledge mining is the process of deriving new and useful knowledge fro...

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

We define a novel, extensional, three-valued semantics for higher-order ...

Please sign up or login with your details

Forgot password? Click here to reset