Abstract
In this paper we are concerned with a fuzzy logic language where program rules extend the classical notion of clause by adding fuzzy connectives and truth degrees on their bodies. In this work we describe an efficient online tool which helps to select such operators and weights in an automatic way, accomplishing with our recent technique for tuning this kind of fuzzy programs. The system offers a comfortable interaction with users for introducing test cases and also provides useful information about the choices that better fit their preferences.
This work has been partially supported by the EU (FEDER), the State Research Agency (AEI) and the Spanish Ministerio de Economía y Competitividad under grant TIN2016-76843-C4-2-R (AEI/FEDER, UE).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
For instance, we have typically several adjoint pairs as shown in Fig. 1: Łukasiewicz logic \( \langle \& _\mathtt {L},{\leftarrow }_\mathtt {L} \rangle \), Gödel logic \( \langle \& _\mathtt {G},{\leftarrow }_\mathtt {G} \rangle \) and product logic \( \langle \& _\mathtt {P},{\leftarrow }_\mathtt {P} \rangle \), which might be used for modeling pessimist, optimist and realistic scenarios, respectively.
- 2.
A complete lattice is a (partially) ordered set \(\langle L,\preceq \rangle \) such that every subset S of L has infimum and supremum elements. It is bounded if it has bottom and top elements, denoted by \(\bot \) and \(\top \), respectively. L is said to be the carrier set of the lattice, and \(\preceq \) its ordering relation.
- 3.
Here, we assume that A in \({\mathcal Q}[A]\) is the selected atom. Furthermore, as it is common practice, mgu(E) denotes the most general unifier of the set of equations E [11].
- 4.
For simplicity, we consider that facts (H with v) are seen as rules of the form \((H{\leftarrow }_i \top ~with ~v)\) for some implication \({\leftarrow }_i\). Furthermore, in this case, we directly derive the state \(\langle ({\mathcal Q}[A/v])\theta ;\sigma \theta \rangle \) since for all &\(_i\).
References
Almendros-Jiménez, J.M., Luna, A., Moreno, G.: Fuzzy xpath through fuzzy logic programming. New Generation Comput. 33(2), 173–209 (2015)
Baldwin, J.F., Martin, T.P., Pilsworth, B.W.: Fril- Fuzzy and Evidential Reasoning in Artificial Intelligence. Wiley, New York (1995)
Guadarrama, S., Muñoz, S., Vaucheret, C.: Fuzzy Prolog: a new approach using soft constraints propagation. Fuzzy Sets Syst. 144(1), 127–150 (2004)
Julián Iranzo, P., Moreno, G., Penabad, J., Vázquez, C.: A fuzzy logic programming environment for managing similarity and truth degrees. In: Escobar, S. (ed.), Proceeding of XIV Jornadas sobre Programación y Lenguajes, PROLE 2014, Cádiz, Spain, vol. 173. EPTCS, pp. 71–86 (2015). doi:10.4204/EPTCS.173.6
Julián-Iranzo, P., Moreno, G., Penabad, J., Vázquez, C.: A declarative semantics for a fuzzy logic language managing similarities and truth degrees. In: Alferes, J.J.J., Bertossi, L., Governatori, G., Fodor, P., Roman, D. (eds.) RuleML 2016. LNCS, vol. 9718, pp. 68–82. Springer, Cham (2016). doi:10.1007/978-3-319-42019-6_5
Julián-Iranzo, P., Moreno, G., Vázquez, C.: Similarity-based strict equality in a fully integrated fuzzy logic language. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 193–207. Springer, Cham (2015). doi:10.1007/978-3-319-21542-6_13
Ishizuka, M., Kanai, N.: Prolog-ELF incorporating fuzzy logic. In: Proceeding of the 9th International Joint Conference on Artificial Intelligence, IJCAI 1985, pp. 701–703. Morgan Kaufmann (1985)
Julián, P., Medina, J., Moreno, G., Ojeda, M.: Efficient thresholded tabulation for fuzzy query answering. In: Bouchon-Meunier, B., Magdalena, L., Ojeda-Aciego, M., Verdegay, J.-L., Yager, R.R. (eds.) Foundations of Reasoning under Uncertainty. STUDFUZZ, vol. 249, pp. 125–141. Springer, Heidelberg (2010). doi:10.1007/978-3-642-10728-3_7
Julián, P., Moreno, G., Penabad, J.: An improved reductant calculus using fuzzy partial evaluation techniques. Fuzzy Sets Syst. 160, 162–181 (2009). doi:10.1016/j.fss.2008.05.006
Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. J. Logic Programm. 12, 335–367 (1992)
Lassez, J.L., Maher, M.J., Marriott, K.: Unification revisited. In: Foundations of Deductive Databases and Logic Programming, pp. 587–625. Morgan Kaufmann, Los Altos (1988)
Lee, R.C.T.: Fuzzy logic and the resolution principle. J. ACM 19(1), 119–129 (1972)
Li, D., Liu, D.: A Fuzzy Prolog Database System. Wiley, New York (1990)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1987)
Medina, J., Ojeda-Aciego, M., Vojtáš, P.: Similarity-based unification: a multi-adjoint approach. Fuzzy Sets Syst. 146, 43–62 (2004)
Moreno, G., Penabad, J., Vidal, G.: Tuning fuzzy logic programs with symbolic execution. CoRR, abs/1608.04688 (2016)
Nguyen, H.T., Walker, E.A.: A First Course in Fuzzy Logic. Chapman & Hall, Boca Ratón (2006)
Rodríguez-Artalejo, M., Romero-Díaz, C.A.: Quantitative logic programming revisited. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 272–288. Springer, Heidelberg (2008). doi:10.1007/978-3-540-78969-7_20
Straccia, U.: Managing uncertainty and vagueness in description logics, logic programs and description logic programs. In: Baroglio, C., Bonatti, P.A., Maluszynski, J., Marchiori, M., Polleres, A., Schaffert, S. (eds.) Reasoning Web. LNCS, vol. 5224, pp. 54–103. Springer, Heidelberg (2008). doi:10.1007/978-3-540-85658-0_2
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Moreno, G., Riaza, J.A. (2017). An Online Tool for Tuning Fuzzy Logic Programs. In: Costantini, S., Franconi, E., Van Woensel, W., Kontchakov, R., Sadri, F., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2017. Lecture Notes in Computer Science(), vol 10364. Springer, Cham. https://doi.org/10.1007/978-3-319-61252-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-61252-2_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61251-5
Online ISBN: 978-3-319-61252-2
eBook Packages: Computer ScienceComputer Science (R0)