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

DOI10.1016/J.JLAMP.2016.09.004zbMATH Open1373.06004OpenAlexW2575897612MaRDI 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)

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

Mathematics Subject Classification ID

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

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.

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

Cites work

• scientific article; zbMATH DE number 5510996 (Why is no real title available?)
• scientific article; zbMATH DE number 3731311 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• A fixed point theorem for non-monotonic functions
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Axiomatizing iteration categories
• Enumeration of success patterns in logic programs
• Equational properties of fixed point operations in Cartesian categories: an overview
• Equational properties of stratified least fixed points (extended abstract)
• Fixed-point operations on ccc's. I
• Fixpoint semantics for logic programming a survey
• Group axioms for iteration
• Minimum model semantics for extensional higher-order logic programming with negation
• Minimum model semantics for logic programs with negation-as-failure
• Modularity aspects of disjunctive stable models
• Splitting an operator: algebraic modularity results for logics with fixpoint semantics
• The product representation theorem for interlaced pre-bilattices: some historical remarks.
• Theorems on pre-fixed points of non-monotonic functions with applications in logic programming and formal grammars
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Unfold⧸fold transformation of general logic programs for the well-founded semantics

Cited in

(3)

• On the Fixpoint Theory of Equality and Its Applications
• Equational properties of stratified least fixed points (extended abstract)
• Ternary Equational Languages

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)