Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs

DOI10.1017/S1471068418000108zbMath1452.68037arXiv1804.08335OpenAlexW2798485127MaRDI QIDQ4559803

Ioanna Symeonidou, Angelos Charalambidis, Panos Rondogiannis

Publication date: 4 December 2018

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

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

zbMATH Keywords

negation in logic programmingapproximation fixpoint theoryhigher-order logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ The Expressive Power of Higher-Order Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence of two fixed-point semantics for definitional higher-order logic programs
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Fixpoint semantics for logic programming a survey
• A fixed point theorem for non-monotonic functions
• 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
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• The intricacies of three-valued extensional semantics for higher-order logic programs

This page was built for publication: Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs