SLFD Logic: Elimination of Data Redundancy in Knowledge Representation

Enciso, Manolo; Mora, Ángel; Guzmán, Inman P. de

doi:10.1007/3-540-36131-6_15

Cited by 30 publications

(33 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As we have illustrated in this work, other equivalent axiomatic systems to CAIL can be designed. As a future work, we plan to develop an alternative sound and complete inference system, which leads us to a more efficient automated reasoning inspired by simplification logic …”

Section: Discussionmentioning

confidence: 99%

An Axiomatic System for Conditional Attribute Implications in Triadic Concept Analysis

Rodríguez‐Lorenzo

Enciso

Missaoui

et al. 2017

Int. J. Intell. Syst.

Self Cite

View full text Add to dashboard Cite

In this paper, we define a sound and complete inference system for triadic implications generated from a formal triadic context K:=⟨G,M,B,I⟩, where G, M, and B are object, attribute, and condition sets, respectively, and I is a ternary relation I⊆G×M×B. The inference system is expressed as a set of axioms “à la Armstrong.” The type of triadic implications we are considering in this paper is called conditional attribute implication (CAI) and has the following form: X→scriptCY, where X and Y are subsets of M, and scriptC is a subset of B. Such implication states that Ximplies Y under all conditions in scriptC and any subset of it. Moreover, we propose a method to compute CAIs from Biedermann's implications. We also introduce an algorithm to compute the closure of an attribute set X w.r.t. a set Σ of CAIs given a set scriptC of conditions.

show abstract

Section: Discussionmentioning

confidence: 99%

An Axiomatic System for Conditional Attribute Implications in Triadic Concept Analysis

Rodríguez‐Lorenzo

Enciso

Missaoui

et al. 2017

Int. J. Intell. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Thus, the guiding force of the Simplification Logic SL F D was to avoid the use of transitivity while still maintaining the possibility of simplifying any set of implications by efficiently removing some redundant attributes [11].…”

Section: Simplification Logic: Basicsmentioning

confidence: 99%

Knowledge discovery in social networks by using a logic-based treatment of implications

Cordero

Enciso

Mora

et al. 2015

Knowledge-Based Systems

Self Cite

View full text Add to dashboard Cite

“…Thus, the concept of non-deterministic ideal operator has allowed us in [10] to characterize the concept of redundancy in functional dependencies sets and to define a new substitution rule that eliminates redundancies in an efficient way. The new substitution rule is the core of a new FD logic, named SL FD [10], equivalent to the axiomatic systems in the bibliography [2,3] but that allows the efficient manipulation of FDs.…”

Section: Conclusion and Current Workmentioning

confidence: 99%

Non-deterministic ideal operators: An adequate tool for formalization in Data Bases

Mora

Guzmán

Enciso

2008

Discrete Applied Mathematics

View full text Add to dashboard Cite

In this paper, we propose the application of formal methods to Software Engineering. The most used data model is the relational model and we present, within the general framework of lattice theory, this analysis of functional dependencies. For this reason, we characterize the concept of f -family by means of a new concept which we call non-deterministic ideal operator (nd.ideal-o). The study of nd.ideal-o.s allows us to obtain results about functional dependencies as trivial particularizations, to clarify the semantics of the functional dependencies and to progress in their efficient use, and to extend the concept of schema. Moreover, the algebraic characterization of the concept of Key of a schema allows us to propose new formal definitions in the lattice framework for classical normal forms in relation schemata. We give a formal definition of the normal forms for functional dependencies more frequently used in the bibliography: the second normal form (2FN), the third normal form(3FN) and Boyce-Codd's normal form (FNBC).

show abstract

SLFD Logic: Elimination of Data Redundancy in Knowledge Representation

Cited by 30 publications

References 12 publications

An Axiomatic System for Conditional Attribute Implications in Triadic Concept Analysis

An Axiomatic System for Conditional Attribute Implications in Triadic Concept Analysis

Knowledge discovery in social networks by using a logic-based treatment of implications

Non-deterministic ideal operators: An adequate tool for formalization in Data Bases

Contact Info

Product

Resources

About