Equivalence of two fixed-point semantics for definitional higher-order logic programs

DOI10.1016/j.tcs.2017.01.005zbMath1359.68041arXiv1509.03013OpenAlexW2963286515MaRDI QIDQ512650

Angelos Charalambidis, Ioanna Symeonidou, Panos Rondogiannis

Publication date: 27 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

extensional higher-order logic programmingsemantics of logic programming

Mathematics Subject Classification ID

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

Related Items (3)

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ Extensional Semantics for Higher-Order Logic Programs with Negation

Uses Software

• HiLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programming with Higher-Order Logic
• Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
• Extensional Higher-Order Logic Programming
• HiLog: A foundation for higher-order logic programming

This page was built for publication: Equivalence of two fixed-point semantics for definitional higher-order logic programs