Some notes on pseudo-closed sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4390 LNAI, Issue , 2007, Pages 151-165

  Rudolph, Sebastian ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CORRELATION METHODS; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

CLOSURE SYSTEMS; IMPLICATIONAL THEORIES; OPTIMIZED ALGORITHMS; PSEUDO CLOSEDNESS;

SET THEORY;

EID: 38049023500     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70901-5_10     Document Type: Conference Paper

References (10)

1. Alan Day. The lattice theory of functional dependencies and normal decompositions. International Journal of Algebra and Computation, 2(4):409-431, 1992.
2. William F. Dowling and Jean H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program., 1(3):267-284, 1984.
3. Bernhard Ganter. Two basic algorithms in concept analysis. Technical Report 831, FB4, TH Darmstadt, 1984.
4. Bernhard Ganter and Rudolf Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1997. Translator-C. Franzke.
5. J.-L. Guigues and Vincent Duquenne. Familles minimales d'implications informatives resultant d'un tableau de données binaires. Math. Sci Humaines, 95:5-18, 1986.
6. S. O. Kuznetsov. On the intractability of computing the Duquenne-Guigues base. Journal of Universal Computer Science, 10(8):927-933, 2004.
7. Sergei O. Kuznetsov and Sergei A. Obiedkov. Counting pseudo-intents and #Pcompleteness. In Rokia Missaoui and Jürg Schmid, editors, ICFCA, volume 3874 of Lecture Notes in Computer Science, pages 306-308. Springer, 2006.
8. David Maier. The Theory of Relational Databases. Computer Science Press, 1983.
9. Uta Priss. Some open problems in formal concept analysis, http://www.upriss.org.uk/fca/problems06.pdf, FEB 2006.
10. Marcel Wild. Implicational bases for finite closure systems. In Wilfried Lex, editor, Arbeitstagung Begriffsanalyse und Künstliche Intelligenz, pages 147-169. Springer, 1991.