Extensional Semantics for Higher-Order Logic Programs with Negation
From MaRDI portal
Publication:2835890
DOI10.1007/978-3-319-48758-8_29zbMath1484.68043arXiv1701.08622OpenAlexW2541650181MaRDI QIDQ2835890
Panos Rondogiannis, Ioanna Symeonidou
Publication date: 30 November 2016
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.08622
Related Items (2)
The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ Extensional Semantics for Higher-Order Logic Programs with Negation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analysis of the equational properties of the well-founded fixed point
- Equivalence of two fixed-point semantics for definitional higher-order logic programs
- A fixed point theorem for non-monotonic functions
- Extensional Semantics for Higher-Order Logic Programs with Negation
- Programming with Higher-Order Logic
- Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
- Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars
- Extensional Higher-Order Logic Programming
- Equational Properties of Stratified Least Fixed Points (Extended Abstract)
- HiLog: A foundation for higher-order logic programming
- The well-founded semantics for general logic programs
- The intricacies of three-valued extensional semantics for higher-order logic programs
- Minimum model semantics for logic programs with negation-as-failure
- Twelve Definitions of a Stable Model
This page was built for publication: Extensional Semantics for Higher-Order Logic Programs with Negation