Item


Fuzzy XPath for the automatic search of fuzzy formulae models

In this paper we deal with propositional fuzzy formulae containing several propositional symbols linked with connectives defined in a lattice of truth degrees more complex than Bool. Instead of focusing on satisfiability (i.e., proving the existence of at least one model) as usually done in a SAT/SMT setting, our interest moves to the problem of finding the whole set of models (with a finite domain) for a given fuzzy formula. We reuse a previous method based on fuzzy logic programming where the formula is conceived as a goal whose derivation tree, provided by our FLOPER tool, contains on its leaves all the models of the original formula, together with other interpretations. Next, we use the ability of the FuzzyXPath tool (developed in our research group with FLOPER) for exploring these derivation trees once exported in XML format, in order to discover whether the formula is a tautology, satisfiable, or a contradiction, thus reinforcing the bi-lateral synergies between FuzzyXPath and FLOPER

This work has been partially supported by the EU (FEDER), and the Spanish MINECO Ministry (Ministerio de Economía y Competitividad) under grants TIN2013-44742-C4-4-R, TIN2012-33042 and TIN2013-45732-C4-2-P

© Lecture Notes in Computer Science, 2015, vol. 9310, p. 385-398

Springer Verlag

Author: Almendros-Jimenez, Jesùs M.
Bofill Arasa, Miquel
Luna-Tedesqui, Alejandro
Moreno, Ginès
Vàzquez, Carlos
Villaret i Ausellé, Mateu
Date: 2015 January 1
Abstract: In this paper we deal with propositional fuzzy formulae containing several propositional symbols linked with connectives defined in a lattice of truth degrees more complex than Bool. Instead of focusing on satisfiability (i.e., proving the existence of at least one model) as usually done in a SAT/SMT setting, our interest moves to the problem of finding the whole set of models (with a finite domain) for a given fuzzy formula. We reuse a previous method based on fuzzy logic programming where the formula is conceived as a goal whose derivation tree, provided by our FLOPER tool, contains on its leaves all the models of the original formula, together with other interpretations. Next, we use the ability of the FuzzyXPath tool (developed in our research group with FLOPER) for exploring these derivation trees once exported in XML format, in order to discover whether the formula is a tautology, satisfiable, or a contradiction, thus reinforcing the bi-lateral synergies between FuzzyXPath and FLOPER
This work has been partially supported by the EU (FEDER), and the Spanish MINECO Ministry (Ministerio de Economía y Competitividad) under grants TIN2013-44742-C4-4-R, TIN2012-33042 and TIN2013-45732-C4-2-P
Format: application/pdf
ISSN: 0302-9743
Document access: http://hdl.handle.net/10256/13726
Language: eng
Publisher: Springer Verlag
Collection: MINECO/PN 2013-2015/TIN2012-33042
Reproducció digital del document publicat a: http://dx.doi.org/10.1007/978-3-319-23540-0_26
Articles publicats (D-IMA)
Is part of: © Lecture Notes in Computer Science, 2015, vol. 9310, p. 385-398
Rights: Tots els drets reservats
Subject: Programació lògica
Logic programming
Teoremes -- Demostració automàtica
Automatic theorem proving
Lògica difusa
Fuzzy logic
Sistemes borrosos
Fuzzy systems
Title: Fuzzy XPath for the automatic search of fuzzy formulae models
Type: info:eu-repo/semantics/article
Repository: DUGiDocs

Subjects

Authors