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/SM...

Descripción completa

Detalles Bibliográficos
Autores: Almendros-Jiménez, Jesús M., Bofill Arasa, Miquel, Luna-Tedesqui, Alejandro, Moreno, Ginès, Vàzquez, Carlos, Villaret i Ausellé, Mateu
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2015
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10256/13726
Acceso en línea:http://hdl.handle.net/10256/13726
Access Level:acceso embargado
Palabra clave:Programació lògica
Logic programming
Teoremes -- Demostració automàtica
Automatic theorem proving
Lògica difusa
Fuzzy logic
Sistemes borrosos
Fuzzy systems
Descripción
Sumario: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