Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Partial Evaluation of Order-Sorted Equational Programs Modulo Axioms Kapitel lesen Erstes Kapitel lesen

2017 | OriginalPaper | Buchkapitel

Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs

verfasst von : Ginés Moreno, Jaime Penabad, José A. Riaza, Germán Vidal

Erschienen in: Logic-Based Program Synthesis and Transformation

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzy logic into logic programming. One of the most difficult tasks when specifying a fuzzy logic program is determining the right weights for each rule, as well as the most appropriate fuzzy connectives and operators. In this paper, we introduce a symbolic extension of fuzzy logic programs in which some of these parameters can be left unknown, so that the user can easily see the impact of their possible values. Furthermore, given a number of test cases, the most appropriate values for these parameters can be automatically computed. Finally, we show some benchmarks that illustrate the usefulness of our approach.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel lpopt: A Rule Optimization Tool for Answer Set Programming
Nächstes Kapitel Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators
Fußnoten
1
For instance, we have typically several adjoint pairs: Ł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
For convenience, in the following sections, we do not distinguish between the connective \(\varsigma \) and its truth function \([\![ \varsigma ]\!]\).
 
4
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 [14].
 
5
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 \( v\, \& _i \top = v\) for all &\(_i\).
 
6
It is important to note that, at execution time, each implication symbol belonging to a concrete adjoint pair is replaced by its adjoint conjunction (see again our repertoire of adjoint pairs in Fig. 1 in the preliminaries section).
 
7
Each cell refers to the average of 100 executions using a desktop computer equipped with an i3-2310 M CPU @ 2.10 GHz and 4,00 GB RAM.
 
8
Instead of focusing on satisfiability, (i.e., proving the existence of at least one model) as usually done in a SAT/SMT setting, in [1, 6] we have faced the problem of finding the whole set of models for a given fuzzy formula by re-using a previous method based on fuzzy logic programming where the formula is conceived as a goal whose derivation tree, provided by the FLOPER tool, contains in its leaves all the models of the original formula, together with other interpretations.
 
Literatur
1.
Almendros-Jiménez, J.M., Bofill, M., Luna-Tedesqui, A., Moreno, G., Vázquez, C., Villaret, M.: Fuzzy XPath for the automatic search of fuzzy formulae models. In: Beierle, C., Dekhtyar, A. (eds.) SUM 2015. LNCS (LNAI), vol. 9310, pp. 385–398. Springer, Cham (2015). doi:10.​1007/​978-3-319-23540-0_​26 CrossRef
2.
Almendros-Jiménez, J.M., Luna, A., Moreno, G.: Fuzzy XPath through fuzzy logic programming. New Gener. Comput. 33(2), 173–209 (2015)CrossRef
3.
Ansótegui, C., Bofill, M., Manyà, F., Villaret, M.: Building automated theorem provers for infinitely-valued logics with satisfiability modulo theory solvers. In: Proceeding of ISMVL 2012, pp. 25–30 (2012)
4.
Baldwin, J.F., Martin, T.P., Pilsworth, B.W.: Fril- Fuzzy and Evidential Reasoning in Artificial Intelligence. Wiley, New York (1995)
5.
Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, 185, pp. 825–885. IOS Press (2009)
6.
Bofill, M., Moreno, G., Vázquez, C., Villaret, M.: Automatic proving of fuzzy formulae with fuzzy logic programming and SMT. In: Fredlund, L.A. (ed.) Programming and Computer Languages 2013, vol. 64, p. 19. ECEASST (2013)
7.
Ishizuka, M., Kanai, N.: Prolog-ELF incorporating fuzzy logic. In: Proceeding of the IJCAI 1985, pp. 701–703. Morgan Kaufmann (1985)
8.
Julián, P., Medina, J., Moreno, G., Ojeda-Aciego, 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–149. Springer, Heidelberg (2010)CrossRef
9.
Julián, P., Moreno, G., Penabad, J.: Operational/interpretive unfolding of multi-adjoint logic programs. J. Univ. Comput. Sci. 12(11), 1679–1699 (2006)
10.
11.
12.
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 CrossRef
13.
Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. J. Logic Program. 12, 335–367 (1992)MathSciNetCrossRef
14.
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, CA (1988)
15.
16.
Li, D., Liu, D.: A Fuzzy Prolog Database System. Wiley, New York (1990)
17.
18.
Medina, J., Ojeda-Aciego, M., Vojtáš, P.: Similarity-based Unification: a multi-adjoint approach. Fuzzy Sets Syst. 146, 43–62 (2004)MathSciNetCrossRefMATH
19.
Morcillo, P.J., Moreno, G., Penabad, J., Vázquez, C.: A practical management of fuzzy truth-degrees using FLOPER. In: Dean, M., Hall, J., Rotolo, A., Tabet, S. (eds.) RuleML 2010. LNCS, vol. 6403, pp. 20–34. Springer, Heidelberg (2010). doi:10.​1007/​978-3-642-16289-3_​4 CrossRef
20.
Moreno, G., Vázquez, C.: Fuzzy logic programming in action with FLOPER. J. Softw. Eng. Appl. 7, 237–298 (2014)CrossRef
21.
Nguyen, H.T., Walker, E.A.: A First Course in Fuzzy Logic. Chapman & Hall, Boca Ratón (2006)MATH
22.
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 CrossRef
23.
Straccia, U.: Managing uncertainty and vagueness in description logics, logic programs and description logic programs. In: Baroglio, C., Bonatti, P.A., Małuszyński, 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 CrossRef
24.
Vidal, A., Bou, F., Godo, L.: An SMT-based solver for continuous t-norm based logics. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds.) SUM 2012. LNCS (LNAI), vol. 7520, pp. 633–640. Springer, Heidelberg (2012). doi:10.​1007/​978-3-642-33362-0_​53 CrossRef
Metadaten
Titel
Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs
verfasst von
Ginés Moreno
Jaime Penabad
José A. Riaza
Germán Vidal
Copyright-Jahr
2017
Buch
Logic-Based Program Synthesis and Transformation

Print ISBN: 978-3-319-63138-7

Electronic ISBN: 978-3-319-63139-4

Copyright-Jahr: 2017

DOI
https://doi.org/10.1007/978-3-319-63139-4_8