{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:32:03Z","timestamp":1725503523997},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781363"},{"type":"electronic","value":"9783540781370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78137-0_7","type":"book-chapter","created":{"date-parts":[[2008,2,13]],"date-time":"2008-02-13T23:34:46Z","timestamp":1202945686000},"page":"90-105","source":"Crossref","is-referenced-by-count":4,"title":["A Formal Context for Symmetric Dependencies"],"prefix":"10.1007","author":[{"given":"Jaume","family":"Baixeries","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Baixeries, J., Balc\u00e1zar, J.L.: Discrete Deterministic Data Mining as Knowledge Compilation. In: Proceedings of Workshop on Discrete Mathematics and Data Mining in SIAM International Conference on Data Mining (2003)"},{"key":"7_CR2","unstructured":"Baixeries, J.: A Formal Concept Analysis Framework To Model Functional Dependencies. In: Proceedings of Mathematical Methods for Learning (2004)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Baixeries, J., Balc\u00e1zar, J.L.: Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis. Formal Concept Analysis. In: Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings. Lecture Notes in Computer Science (2005)","DOI":"10.1007\/978-3-540-32262-7_11"},{"key":"7_CR4","unstructured":"Baixeries, J., Balc\u00e1zar, J.L.: Unified Characterization of Symmetric Dependencies with Lattices. In: Contributions to ICFCA 2006. 4th International Conference on Formal Concept Analysis (2005)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Beeri, C.: On the Membership Problem for Functional and Multivalued Dependencies in Relational Databases. ACM Transactions on Database Systems (September 1980)","DOI":"10.1145\/320613.320614"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Beeri, C., Vardi, M.: Formal Systems for Tuple and Equality Generating Dependencies. SIAM Journal on Computing (1984)","DOI":"10.1137\/0213006"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Caspard, N., Monjardet, B.: The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: a Survey. In: Proceedings of the 1998 Conference on Ordinal and Symbolic Data Analysis (OSDA-98). Discrete Applied Mathematics (2003)","DOI":"10.1016\/S0166-218X(02)00209-3"},{"key":"7_CR8","unstructured":"Day, A.: A Lattice Interpretation of Database Dependencies. Semantics of Programming Languages and Model Theory (1993)"},{"key":"7_CR9","unstructured":"Demetrovics, J., et al.: Normal Form Relation Schemes: a New Characterization. Acta Cybernetica (1992)"},{"key":"7_CR10","unstructured":"Demetrovics, J., Huy, X.: Representation of Closure for Functional, Multivalued and Join Dependencies. Computers and Artificial Intelligence (1992)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Demetrovics, J., Libkin, L., Muchnik, I.: Functional Dependencies in Relational Databases: a Lattice Point of View. Discrete Applied Mathematics (1992)","DOI":"10.1016\/0166-218X(92)90028-9"},{"key":"7_CR12","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Beeri, C., Fagin, R., Howard, J.H.: A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations. In: Proceedings of the 1977 ACM SIGMOD International Conference on Management of Data, August 3-5, 1977, Toronto, Canada (1977)","DOI":"10.1145\/509404.509414"},{"key":"7_CR14","unstructured":"Fagin, R.: Armstrong Databases. In: Proc.\u00a07th IBM Symposium on Mathematical Foundations of Computer Science, Kanagawa, Japan (1982)"},{"key":"7_CR15","unstructured":"Duquenne, V., Guigues, J.L.: Familles Minimales d\u2019Implications Informatives Resultant d\u2019un Tableau de Don\u00e9es Binaires. Mathematics and Social Sciences (1986)"},{"key":"7_CR16","unstructured":"Gottlob, E., Libkin, L.: Investigations on Armstrong Relations, Dependency Inference, and Excluded Functional Dependencies. Acta Cybernetica (1990)"},{"key":"7_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-7633-9","volume-title":"General Lattice Theory","author":"G.. Gr\u00e4tzer","year":"1978","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory. Academic Press, London (1978)"},{"key":"7_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artificial Intelligence\u00a014(2\u20133) (2004)","DOI":"10.1080\/09528130210164170"},{"key":"7_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44794-6_24","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S.O. Kuznetsov","year":"2001","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Algorithms for the Construction of Concept Lattices and Their Diagram Graphs. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol.\u00a02168, Springer, Heidelberg (2001)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Lopes, S., Petit, J.-M., Lakhal, L.: Functional and Approximate Dependency Mining: Database and FCA Points of View. Journal of Experimental and Theoretical Artificial Intelligence\u00a014(2-3) (2002)","DOI":"10.1080\/09528130210164143"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46439-5_24","volume-title":"Advances in Database Technology - EDBT 2000","author":"S. Lopes","year":"2000","unstructured":"Lopes, S., Petit, J.-M., Lakhal, L.: Efficient Discovery of Functional Dependencies and Armstrong Relations. In: Zaniolo, C., et al. (eds.) EDBT 2000. LNCS, vol.\u00a01777, Springer, Heidelberg (2000)"},{"key":"7_CR23","unstructured":"Ullman, J.D.: Principles of Database Systems. Computer Science Press (1982)"},{"key":"7_CR24","unstructured":"Valtchev, P., Missaoui, R., Lebrun, P.: A Fast Algorithm for Building the Hasse Diagram of a Galois Lattice. Actes du Colloque LaCIM (2000)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78137-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:59:15Z","timestamp":1619506755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78137-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781363","9783540781370"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78137-0_7","relation":{},"subject":[]}}