Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics (Extended Version)
By: Pascal Kettmann, Jesse Heyninck, Hannes Strass
Potential Business Impact:
Makes computers understand fuzzy ideas better.
Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of the most prominent classical semantics, namely the stable model and the well-founded semantics, can be reconstructed within the general framework of approximation fixpoint theory (AFT). This not only widens the scope of AFT from two- to many-valued logics, but allows a wide range of existing AFT results to be applied to fuzzy logic programming. As first examples of such applications, we clarify the formal relationship between existing semantics, generalize the notion of stratification from classical to fuzzy logic programs, and devise "more precise" variants of the semantics.
Similar Papers
Approximation Fixpoint Theory with Refined Approximation Spaces
Artificial Intelligence
Makes computer thinking more flexible and powerful.
A Category-Theoretic Perspective on Approximation Fixpoint Theory
Logic in Computer Science
Helps computers understand and use knowledge better.
Fixpoint Semantics for DatalogMTL with Negation
Logic in Computer Science
Helps computers understand time and rules better.