An analysis of the equational properties of the well-founded fixed point - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Logical and Algebraic Methods in Programming Année : 2017

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

Résumé

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and in particular 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 standard equational properties of fixed point operations described by the axioms of iteration theories.

Dates et versions

hal-01806565 , version 1 (03-06-2018)

Identifiants

Citer

Arnaud Carayol, Zoltán Ésik. An analysis of the equational properties of the well-founded fixed point. Journal of Logical and Algebraic Methods in Programming, 2017, 86 (1), pp.308-318. ⟨10.1016/j.jlamp.2016.09.004⟩. ⟨hal-01806565⟩
36 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More