{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:28Z","timestamp":1725551968590},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322030"},{"type":"electronic","value":"9783540322047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671404_13","type":"book-chapter","created":{"date-parts":[[2006,1,23]],"date-time":"2006-01-23T12:03:57Z","timestamp":1138017837000},"page":"191-204","source":"Crossref","is-referenced-by-count":2,"title":["About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base"],"prefix":"10.1007","author":[{"given":"Alain","family":"G\u00e9ly","sequence":"first","affiliation":[]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing\u00a024(6), 1278\u20131304 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and ai. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"key":"13_CR3","unstructured":"Ibaraki, T., Kogan, A., Makino, K.: Inferring minimal functional dependencies in horn and q-horn theories. Technical report, Rutcor Research Report, RRR 35-2000 (2000)"},{"key":"13_CR4","volume-title":"The theory of relational data bases","author":"D. Maier","year":"1983","unstructured":"Maier, D.: The theory of relational data bases. Computer Science Press, Rockville (1983)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 618\u2013628 (1996)","DOI":"10.1006\/jagm.1996.0062"},{"key":"13_CR6","first-page":"5","volume":"95","author":"J. Guigues","year":"1986","unstructured":"Guigues, J., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math. Sci. hum\u00a095, 5\u201318 (1986)","journal-title":"Math. Sci. hum"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00012-002-8183-2","volume":"47","author":"G. Bordalo","year":"2002","unstructured":"Bordalo, G., Monjardet, B.: The lattice of strict completions of a finite poset. Algebra Universalis\u00a047, 183\u2013200 (2002)","journal-title":"Algebra Universalis"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1005805026315","volume":"14","author":"J.B. Nation","year":"1997","unstructured":"Nation, J.B., Pogel, A.: The lattice of completions of an ordered set. Order\u00a014, 1\u20137 (1997)","journal-title":"Order"},{"key":"13_CR9","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Technical report, No 831, Technische Hochschule Darmstadt (1984)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/320064.320066","volume":"1","author":"C. Beeri","year":"1979","unstructured":"Beeri, C., Berstein, P.: Computational problems related to the design of normal form relational schemas. ACM Trans. on database systems\u00a01, 30\u201359 (1979)","journal-title":"ACM Trans. on database systems"},{"key":"13_CR11","unstructured":"Wild, M.: Implicational bases for finite closure systems. Technical report, No 1210, Technische Hochschule Darmstadt (1989)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0020-0190(86)90063-3","volume":"3","author":"R.C. Shock","year":"1986","unstructured":"Shock, R.C.: Computing the minimum cover of functional dependencies. Information Processing Letters\u00a03, 157\u2013159 (1986)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671404_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:15Z","timestamp":1619507655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671404_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322030","9783540322047"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11671404_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}