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

2015/11/30 by Arnaud Carayol, Carayol, Arnaud, Zoltan Esik +1
Computer Science · #06B23 #68T30 #D.1.6 #Discrete Mathematics (cs.DM) #F.3.2 #FOS: Computer and information sciences #I.2.4 #Logic in Computer Science (cs.LO) #acm:06B23 #acm:68T30 #cs.DM #cs.LO #msc:06B23 #msc:68T30

paper · pdf · doi:10.48550/arxiv.1511.09423

arxiv created 2015/12/01 · arxiv updated 2015/12/02

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.

Related

• Equational properties of stratified least fixed points
• A logic with temporally accessible iteration
• Approximation Fixpoint Theory with Refined Approximation Spaces
• Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion
• On the problem of computing the well-founded semantics