An analysis of the equational properties of the well-founded fixed point

DOI10.1016/j.jlamp.2016.09.004zbMath1373.06004arXiv1511.09423OpenAlexW2575897612MaRDI QIDQ347388

Zoltán Ésik, Arnaud Carayol

Publication date: 30 November 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (2)

Ternary Equational Languages ⋮ Extensional Semantics for Higher-Order Logic Programs with Negation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Fixed-point operations on ccc's. I
• Group axioms for iteration
• Enumeration of success patterns in logic programs
• Fixpoint semantics for logic programming a survey
• A fixed point theorem for non-monotonic functions
• The product representation theorem for interlaced pre-bilattices: some historical remarks.
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• 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
• Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
• Equational Properties of Stratified Least Fixed Points (Extended Abstract)
• Modularity Aspects of Disjunctive Stable Models
• Minimum model semantics for logic programs with negation-as-failure
• Splitting an operator
• Unfold⧸fold transformation of general logic programs for the well-founded semantics

This page was built for publication: An analysis of the equational properties of the well-founded fixed point