Formation of the <i>D</i>-basis from implicational systems using Simplification logic

Rodríguez‐Lorenzo, Estrella; Adaricheva, Kira; Enciso, Manuel; Mora, Ángel

doi:10.1080/03081079.2017.1349632

Cited by 6 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The inference rules of SL are enough to compute all the models and their main advantage is that they can be seen as logical equivalence rules (see Proposition 2), providing a transformation stronger than that of the usual inference rules. These equivalences have opened the door to the development of several automated methods to manage implications by using Logic, for instance: to compute the syntactic attribute closure [7], to reduce the specification of implications [6], to compute several kinds of basis of implications [8,14] and, the one that has inspired this work, to compute all minimal generators and closed sets [15].…”

Section: Definition 2 [Syntax and Semantics Of Sl]mentioning

confidence: 99%

A Formal Concept Analysis Approach to Cooperative Conversational Recommendation

Enciso¹,

Mora²,

Ojeda‐Aciego³

et al. 2020

IJCIS

Self Cite

View full text Add to dashboard Cite

We focus on the development of a method to guide the choice of a set of users in an environment where the number of features describing the items is high and user interaction becomes laborious. Using the framework of formal concept analysis, particularly the notion of implication between attributes, we propose a method strongly based on logic which allows to manage the users' preferences by following a conversational paradigm. Concerning complexity, to build the conversation and provide updated information based on the users' previous actions (choices) the method has polynomial delay.

show abstract

Section: Definition 2 [Syntax and Semantics Of Sl]mentioning

confidence: 99%

A Formal Concept Analysis Approach to Cooperative Conversational Recommendation

Enciso¹,

Mora²,

Ojeda‐Aciego³

et al. 2020

IJCIS

Self Cite

View full text Add to dashboard Cite

show abstract

Direct and Binary Direct Bases for One-Set Updates of a Closure System

Adaricheva

Ninesling

2019

Formal Concept Analysis

Self Cite

View full text Add to dashboard Cite

We introduce a concept of a binary-direct implicational basis and show that the shortest binary-direct basis exists and it is known as the D-basis introduced in Adaricheva, Nation, Rand [4]. Using this concept we approach the algorithmic solution to the Singleton Horn Extension problem, as well as the one set removal problem, when the closure system is given by the canonical direct or binary-direct basis. In this problem, a new closed set is added to or removed from the closure system forcing the re-write of a given basis. Our goal is to obtain the same type of implicational basis for the new closure system as was given for original closure system and to make the basis update an optimal process.

show abstract