SLFD Logic: Elimination of Data Redundancy in Knowledge Representation-Reference-Cited by-同舟云学术

SLFD Logic: Elimination of Data Redundancy in Knowledge Representation

Published:2002 Issue: Volume: Page:141-150
ISSN:0302-9743
Container-title:Advances in Artificial Intelligence — IBERAMIA 2002
language:
Short-container-title:

Author:

Cordero Pablo,Enciso Manolo,Mora Angel,de Guzmán Inmaculada P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36131-6_15

Reference21 articles.

1. William W. Armstrong. Dependency structures of data base relationships. Proc. IFIP Congress. North Holland, Amsterdam, pages 580–583, 1974.

2. Paolo Atzeni and Valeria De Antonellis. Relational Database Theory. The Benjamin/Cummings Publishing Company Inc., 1993.

3. D.A. Bell. From data properties to evidence. IEEE Transactions on Knowledge andData Engireering, 5(6):965–968, 1993.

4. D.A. Bell and J.W. Guan. Computational methods for rought classifications and discovery. J. American Society for Information Sciences, To appear. Special issue on Data Mining.

5. Elisa Bertino, Barbara Catania, and Gian Piero Zarri. Intelligent Database Systems. ACM Press. Addison-Wesley, ISBN 0-201-87736-8, 2001.

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimal Generators from Positive and Negative Attributes: Analysing the Knowledge Space of a Mathematics Course;International Journal of Computational Intelligence Systems;2022-08-09

2. Formal Methods in FCA and Big Data;Complex Data Analytics with Formal Concept Analysis;2021-12-08

3. Clustering and Identification of Core Implications;Formal Concept Analysis;2021

4. Minimal generator of a non-deterministic operator;International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004);2019-04-29

5. Direct-optimal basis computation by means of the fusion of simplification rules;Discrete Applied Mathematics;2018-11