An analysis of the equational properties of the well-founded fixed point
From MaRDI portal
Publication:347388
DOI10.1016/J.JLAMP.2016.09.004zbMATH Open1373.06004arXiv1511.09423OpenAlexW2575897612MaRDI QIDQ347388FDOQ347388
Authors: Arnaud Carayol, Zoltán Ésik 
Publication date: 30 November 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Abstract: Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study the logical properties of the (parametric) well-founded fixed point operation. We show that the operation satisfies several, but not all of the equational properties of fixed point operations described by the axioms of iteration theories.
Full work available at URL: https://arxiv.org/abs/1511.09423
Recommendations
- Equational properties of stratified least fixed points (extended abstract)
- The equational logic of fixed points
- Generalized well-founded semantics for logic programs
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
Logic programming (68N17) Complete lattices, completions (06B23) Semantics in the theory of computing (68Q55)
Cites Work
- Modularity aspects of disjunctive stable models
- Group axioms for iteration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unfold⧸fold transformation of general logic programs for the well-founded semantics
- The product representation theorem for interlaced pre-bilattices: some historical remarks.
- Fixpoint semantics for logic programming a survey
- Enumeration of success patterns in logic programs
- A fixed point theorem for non-monotonic functions
- Axiomatizing iteration categories
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- 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)
- Minimum model semantics for logic programs with negation-as-failure
- Splitting an operator
- Title not available (Why is that?)
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Fixed-point operations on ccc's. I
Cited In (3)
This page was built for publication: An analysis of the equational properties of the well-founded fixed point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347388)
