JavaScript is disabled for your browser. Some features of this site may not work without it.

    Listar

    Todo RIUMAComunidades & ColeccionesPor fecha de publicaciónAutoresTítulosMateriasTipo de publicaciónCentrosEsta colecciónPor fecha de publicaciónAutoresTítulosMateriasTipo de publicaciónCentros

    Mi cuenta

    AccederRegistro

    Estadísticas

    Ver Estadísticas de uso

    DE INTERÉS

    Datos de investigaciónReglamento de ciencia abierta de la UMAPolítica de RIUMAPolitica de datos de investigación en RIUMASHERPA/RoMEODulcinea
    Preguntas frecuentesManual de usoDerechos de autorContacto/Sugerencias
    Ver ítem 
    •   RIUMA Principal
    • Investigación
    • Matemática Aplicada - (MA)
    • MA - Contribuciones a congresos científicos
    • Ver ítem
    •   RIUMA Principal
    • Investigación
    • Matemática Aplicada - (MA)
    • MA - Contribuciones a congresos científicos
    • Ver ítem

    From an implicational system to its corresponding D-basis

    • Autor
      Rodríguez-Lorenzo, Estrella; Adaricheva, Kira; Cordero-Ortega, PabloAutoridad Universidad de Málaga; Enciso-García-Oliveros, ManuelAutoridad Universidad de Málaga; Mora-Bonilla, AngelAutoridad Universidad de Málaga
    • Fecha
      2015-10-30
    • Palabras clave
      Operadores, Álgebras de
    • Resumen
      Closure system is a fundamental concept appearing in several areas such as databases, formal concept analysis, artificial intelligence, etc. It is well-known that there exists a connection between a closure operator on a set and the lattice of its closed sets. Furthermore, the closure system can be replaced by a set of implications but this set has usually a lot of redundancy inducing non desired properties. In the literature, there is a common interest in the search of the mini- mality of a set of implications because of the importance of bases. The well-known Duquenne-Guigues basis satisfies this minimality condition. However, several authors emphasize the relevance of the optimality in order to reduce the size of implications in the basis. In addition to this, some bases have been defined to improve the computation of closures relying on the directness property. The efficiency of computation with the direct basis is achieved due to the fact that the closure is computed in one traversal. In this work, we focus on the D-basis, which is ordered-direct. An open problem is to obtain it from an arbitrary implicational system, so it is our aim in this paper. We introduce a method to compute the D-basis by means of minimal generators calculated using the Simplification Logic for implications.
    • URI
      http://hdl.handle.net/10630/10627
    • Compartir
      RefworksMendeley
    Mostrar el registro completo del ítem
    Ficheros
    CLA2015_2015sep01 ESTRELLA.pdf (922.7Kb)
    Colecciones
    • MA - Contribuciones a congresos científicos

    Estadísticas

    Ver Estadísticas de uso
    Buscar en Dimension
    REPOSITORIO INSTITUCIONAL UNIVERSIDAD DE MÁLAGA
    REPOSITORIO INSTITUCIONAL UNIVERSIDAD DE MÁLAGA
     

     

    REPOSITORIO INSTITUCIONAL UNIVERSIDAD DE MÁLAGA
    REPOSITORIO INSTITUCIONAL UNIVERSIDAD DE MÁLAGA