Formation of the D-basis from implicational systems using Simplification logic

Estrella Rodríguez-Lorenzo, Kira Adaricheva, Pablo Cordero, Manuel Enciso, Angel Mora

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Sets of implications defining closure systems are used as a standard way to represent knowledge, and the search of implicational systems satisfying some criteria constitutes one of the most active topics in the study of closure systems and their applications. Here, we focus on the generation of the D-basis, known to be an ordered direct basis, allowing a very efficient attribute closure computation. We operate with the aggregatedD-basis and provide an algorithm to get it from an arbitrary implicational set. The method has been designed on the interrelation between minimal covers and minimal generators, and it is inspired by the inference system of the Simplification Logic. Moreover, we develop an experiment to show the better performance of the new method compared to the earlier version of the algorithm.

Original languageEnglish
Pages (from-to)547-568
Number of pages22
JournalInternational Journal of General Systems
Issue number5
Publication statusPublished - Jul 4 2017


  • Direct basis
  • implicational system
  • minimal cover
  • minimal generator
  • simplification logic

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Formation of the D-basis from implicational systems using Simplification logic'. Together they form a unique fingerprint.

Cite this