{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:30Z","timestamp":1759638810135},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119279"},{"type":"electronic","value":"9783642119286"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11928-6_9","type":"book-chapter","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T11:21:07Z","timestamp":1270639267000},"page":"124-137","source":"Crossref","is-referenced-by-count":9,"title":["Hardness of Enumerating Pseudo-intents in the Lectic Order"],"prefix":"10.1007","author":[{"given":"Felix","family":"Distel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., Ganter, B., Sattler, U., Sertkaya, B.: Completing description logic knowledge bases using formal concept analysis. In: Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI\u00a02007). AAAI Press\/The MIT Press (2007)","DOI":"10.25368\/2022.155"},{"key":"9_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: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M.L. Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms\u00a021(3), 618\u2013628 (1996)","journal-title":"Journal of Algorithms"},{"key":"9_CR4","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Preprint 831, Fachbereich Mathematik, TU Darmstadt, Darmstadt, Germany (1984)"},{"key":"9_CR5","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1997","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York (1997)"},{"key":"9_CR6","first-page":"5","volume":"95","author":"J.-L. Guigues","year":"1986","unstructured":"Guigues, J.-L., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math. Sci. Humaines\u00a095, 5\u201318 (1986)","journal-title":"Math. Sci. Humaines"},{"issue":"8","key":"9_CR7","first-page":"927","volume":"10","author":"S.O. Kuznetsov","year":"2004","unstructured":"Kuznetsov, S.O.: On the intractability of computing the Duquenne-Guigues base. Journal of Universal Computer Science\u00a010(8), 927\u2013933 (2004)","journal-title":"Journal of Universal Computer Science"},{"key":"9_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/11671404_21","volume-title":"Formal Concept Analysis","author":"S.O. Kuznetsov","year":"2006","unstructured":"Kuznetsov, S.O.: Counting pseudo-intents and #P-completeness. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03874, pp. 306\u2013308. Springer, Heidelberg (2006)"},{"key":"9_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"289","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, pp. 289\u2013300. Springer, Heidelberg (2001)"},{"issue":"1-4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10472-007-9057-2","volume":"49","author":"S. Obiedkov","year":"2007","unstructured":"Obiedkov, S., Duquenne, V.: Attribute-incremental construction of the canonical implication basis. Annals of Mathematics and Artificial Intelligence\u00a049(1-4), 77\u201399 (2007)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9_CR11","series-title":"Lecture Notes in Artificial Intelligence","first-page":"130","volume-title":"ICFCA 2009","author":"B. Sertkaya","year":"2009","unstructured":"Sertkaya, B.: Some computational problems related to pseudo-intents. In: Ferr\u00e9, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol.\u00a05548, pp. 130\u2013145. Springer, Heidelberg (2009)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/978-3-642-03079-6_22","volume-title":"ICCS 2009","author":"B. Sertkaya","year":"2009","unstructured":"Sertkaya, B.: Towards the complexity of recognizing pseudo-intents. In: Dau, F., Rudolph, S. (eds.) ICCS 2009. LNCS, vol.\u00a05662, pp. 284\u2013292. Springer, Heidelberg (2009)"}],"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-642-11928-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T18:48:23Z","timestamp":1685558903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11928-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119279","9783642119286"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11928-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}