Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
From MaRDI portal
Publication:2931276
DOI10.1017/S1471068414000313zbMath1309.68030arXiv1405.3792OpenAlexW2122293551MaRDI QIDQ2931276
Panos Rondogiannis, Angelos Charalambidis, Zoltán Ésik
Publication date: 25 November 2014
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.3792
Related Items (8)
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ Unnamed Item ⋮ 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
Cites Work
This page was built for publication: Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
