The intricacies of three-valued extensional semantics for higher-order logic programs

DOI10.1017/S1471068417000357zbMath1422.68028arXiv1707.04704OpenAlexW2885902420MaRDI QIDQ4592720

Panos Rondogiannis, Ioanna Symeonidou

Publication date: 8 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.04704

zbMATH Keywords

extensional higher-order logic programmingnegation in logic programming

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (2)

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ Extensional Semantics for Higher-Order Logic Programs with Negation

Uses Software

• HiLog

Cites Work

• Equivalence of two fixed-point semantics for definitional higher-order logic programs
• Extensional Semantics for Higher-Order Logic Programs with Negation
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
• Extensional Higher-Order Logic Programming
• Equational Properties of Stratified Least Fixed Points (Extended Abstract)
• Negation as failure using tight derivations for general logic programs
• HiLog: A foundation for higher-order logic programming
• The well-founded semantics for general logic programs
• Minimum model semantics for logic programs with negation-as-failure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The intricacies of three-valued extensional semantics for higher-order logic programs