Extensional semantics for higher-order logic programs with negation

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We develop an extensional semantics for higher-order logic programs with negation, generalizing the technique that was introduced in [2,3] for positive higher-order programs. In this way we provide an alternative extensional semantics for higher-order logic programs with negation to the one proposed in [6]. As an immediate useful consequence of our developments, we define for the language we consider the notions of stratification and local stratification, which generalize the familiar such notions from classical logic programming. We demonstrate that for stratified and locally stratified higher-order logic programs, the proposed semantics never assigns the unknown truth value.

Cite

CITATION STYLE

APA

Rondogiannis, P., & Symeonidou, I. (2016). Extensional semantics for higher-order logic programs with negation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10021 LNAI, pp. 447–462). Springer Verlag. https://doi.org/10.1007/978-3-319-48758-8_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free