-
1
-
-
0000710299
-
Queries and concept learning
-
Angluin, D.: Queries and concept learning. Machine Learning 2, 319-342 (1988)
-
(1988)
Machine Learning
, vol.2
, pp. 319-342
-
-
Angluin, D.1
-
2
-
-
0001454571
-
Dependency structure of data base relationships
-
Armstrong, W.W.: Dependency structure of data base relationships. In: Proc. IFIP Congress, pp. 580-583 (1974)
-
(1974)
Proc. IFIP Congress
, pp. 580-583
-
-
Armstrong, W.W.1
-
3
-
-
0003727420
-
-
2nd edn. Cambridge University Press, New York
-
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, New York (2010)
-
(2010)
The Description Logic Handbook: Theory, Implementation and Applications
-
-
Baader, F.1
Calvanese, D.2
McGuinness, D.L.3
Nardi, D.4
Patel-Schneider, P.F.5
-
4
-
-
77955249194
-
Modal Logic for Open Minds
-
Center for the Study of Language and Information
-
van Benthem, J.: Modal Logic for Open Minds. CSLI lecture notes, Center for the Study of Language and Information (2010)
-
(2010)
CSLI Lecture Notes
-
-
Van Benthem, J.1
-
5
-
-
79551548430
-
On the complexity of enumerating pseudo-intents
-
Distel, F., Sertkaya, B.: On the complexity of enumerating pseudo-intents. Discrete Applied Mathematics 159(6), 450-466 (2011)
-
(2011)
Discrete Applied Mathematics
, vol.159
, Issue.6
, pp. 450-466
-
-
Distel, F.1
Sertkaya, B.2
-
6
-
-
0346876953
-
Attribute exploration with background knowledge
-
Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science 217(2), 215-233 (1999)
-
(1999)
Theoretical Computer Science
, vol.217
, Issue.2
, pp. 215-233
-
-
Ganter, B.1
-
7
-
-
35048846236
-
Implications in Triadic Formal Contexts
-
Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds.) ICCS 2004. Springer, Heidelberg
-
Ganter, B., Obiedkov, S.: Implications in Triadic Formal Contexts. In: Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds.) ICCS 2004. LNCS (LNAI), vol. 3127, pp. 186-195. Springer, Heidelberg (2004)
-
(2004)
LNCS (LNAI)
, vol.3127
, pp. 186-195
-
-
Ganter, B.1
Obiedkov, S.2
-
9
-
-
0002819235
-
Famille minimale d'implications informatives résultant d'un tableau de données binaires
-
Guigues, J.-L., Duquenne, V.: Famille minimale d'implications informatives résultant d'un tableau de données binaires. Mathématiques et Sciences Humaines 24(95), 5-18 (1986)
-
(1986)
Mathématiques et Sciences Humaines
, vol.24
, Issue.95
, pp. 5-18
-
-
Guigues, J.-L.1
Duquenne, V.2
-
10
-
-
47549094827
-
Some decision and counting problems of the Duquenne-Guigues basis of implications
-
Kuznetsov, S.O., Obiedkov, S.: Some decision and counting problems of the Duquenne-Guigues basis of implications. Discrete Applied Mathematics 156(11), 1994-2003 (2008)
-
(2008)
Discrete Applied Mathematics
, vol.156
, Issue.11
, pp. 1994-2003
-
-
Kuznetsov, S.O.1
Obiedkov, S.2
-
12
-
-
38049021526
-
A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
-
Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. Springer, Heidelberg
-
Rouane Hacene, M., Huchard, M., Napoli, A., Valtchev, P.: A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 51-65. Springer, Heidelberg (2007)
-
(2007)
LNCS (LNAI)
, vol.4390
, pp. 51-65
-
-
Rouane Hacene, M.1
Huchard, M.2
Napoli, A.3
Valtchev, P.4
|