Representing Fuzzy Logic Programs by Graded Attribute Implications
We present a link between two types of logic systems for reasoning with graded if-then rules: the system of fuzzy logic programming (FLP) in sense of Vojtáš and the system of fuzzy attribute logic (FAL) in sense of Belohlavek and Vychodil. We show that each finite theory consisting of formulas of FAL can be represented by a definite program so that the semantic entailment in FAL can be characterized by correct answers for the program. Conversely, we show that for each definite program there is a collection of formulas of FAL so that the correct answers can be represented by the entailment in FAL. Using the link, we can transport results from FAL to FLP and vice versa which gives us, e.g., a syntactic characterization of correct answers based on Pavelka-style Armstrong-like axiomatization of FAL.
Keywordslogic programming attribute implications functional dependencies ordinal scales residuated lattices
Unable to display preview. Download preview PDF.
- 4.Belohlavek, R., Vychodil, V.: Query systems in similarity-based databases: logical foundations, expressive power, and completeness. In: ACM Symposium on Applied Computing (SAC), pp. 1648–1655. ACM (2010)Google Scholar
- 10.Klement, E.P., Mesiar, R., Pap, E.: Triangular Norms, 1st edn. Springer (2000)Google Scholar
- 12.Medina, J., Ojeda-Aciego, M., Vojtáš, P.: A Procedural Semantics for Multi-adjoint Logic Programming. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 290–297. Springer, Heidelberg (2001)Google Scholar
- 13.Mendelson, E.: Introduction to mathematical logic. Chapman and Hall (1987)Google Scholar
- 14.Nilsson, U., Maluszynski, J.: Logic, Programming, and PROLOG, 2nd edn. John Wiley & Sons, Inc., New York (1995)Google Scholar