{"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":1759638810331},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030789"},{"type":"electronic","value":"9783642030796"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03079-6_22","type":"book-chapter","created":{"date-parts":[[2009,7,23]],"date-time":"2009-07-23T15:40:53Z","timestamp":1248363653000},"page":"284-292","source":"Crossref","is-referenced-by-count":5,"title":["Towards the Complexity of Recognizing Pseudo-intents"],"prefix":"10.1007","author":[{"given":"Bar\u0131\u015f","family":"Sertkaya","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Berge, C.: Hypergraphs. Elsevier Science Publishers B.V, North Holland (1989)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0012-365X(91)90005-M","volume":"88","author":"V. Duquenne","year":"1991","unstructured":"Duquenne, V.: The core of finite lattices. Discrete Mathematics\u00a088, 133\u2013147 (1991)","journal-title":"Discrete Mathematics"},{"issue":"6","key":"22_CR3","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":"22_CR4","series-title":"Lecture Notes in Computer Science","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, vol.\u00a02424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"issue":"3","key":"22_CR5","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":"22_CR6","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Technical Report Preprint-Nr. 831, Technische Hochschule Darmstadt, Darmstadt, Germany (1984)"},{"key":"22_CR7","doi-asserted-by":"publisher","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, Berlin (1999)"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/235767.235769","volume":"27","author":"J. Goldsmith","year":"1978","unstructured":"Goldsmith, J., Levy, M., Mundhenk, M.: Limited nondeterminism. SIGACT\u00a027(2), 20\u201329 (1978)","journal-title":"SIGACT"},{"key":"22_CR9","first-page":"5","volume":"95","author":"J.-L. Guigues","year":"1986","unstructured":"Guigues, J.-L., Duquenne, V.: Familles minimales d\u2019implications informatives resultant d\u2019un tableau de donn\u00e9es binaries. Math\u00e9matiques, Informatique et Sciences Humaines\u00a095, 5\u201318 (1986)","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: Proceedings of the Sixteenth Symposium on Principles of Database Systems (PODS 1997), pp. 209\u2013216 (1997)","DOI":"10.1145\/263661.263684"},{"issue":"5","key":"22_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ipl.2006.04.004","volume":"99","author":"P. Janssen","year":"2006","unstructured":"Janssen, P., Nourine, L.: Minimum implicational basis for meet-semidistributive lattices. Information Processing Letters\u00a099(5), 199\u2013202 (2006)","journal-title":"Information Processing Letters"},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters\u00a027(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-57568-5_271","volume-title":"Algorithms and Computation","author":"D.J. Kavvadias","year":"1993","unstructured":"Kavvadias, D.J., Papadimitriou, C.H., Sideri, M.: On horn envelopes and hypergraph transversals. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 399\u2013405. Springer, Heidelberg (1993)"},{"issue":"8","key":"22_CR14","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":"22_CR15","series-title":"Lecture Notes in Computer Science","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., Obiedkov, S.A.: Counting pseudo-intents and #P-completeness. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS, vol.\u00a03874, pp. 306\u2013308. Springer, Heidelberg (2006)"},{"issue":"11","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2007.04.014","volume":"156","author":"S.O. Kuznetsov","year":"2008","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Some decision and counting problems of the Duquenne-Guigues basis of implications. Discrete Applied Mathematics\u00a0156(11), 1994\u20132003 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-4","key":"22_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10472-007-9057-2","volume":"49","author":"S.A. Obiedkov","year":"2007","unstructured":"Obiedkov, S.A., 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":"22_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-01815-2_11","volume-title":"Proceedings of the 7th International Conference on Formal Concept Analysis (ICFCA 2009)","author":"B. Sertkaya","year":"2009","unstructured":"Sertkaya, B.: Some computational problems related to pseudo-intents. In: Ferr\u00e9, S., Rudolph, S. (eds.) Proceedings of the 7th International Conference on Formal Concept Analysis (ICFCA 2009). LNCS (LNAI), vol.\u00a05548, pp. 130\u2013145. Springer, Heidelberg (2009)"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.2989\/16073600009485964","volume":"23","author":"M. Wild","year":"2000","unstructured":"Wild, M.: Optimal implicational bases for finite modular lattices. Quaestiones Mathematicae\u00a023, 153\u2013161 (2000)","journal-title":"Quaestiones Mathematicae"}],"container-title":["Lecture Notes in Computer Science","Conceptual Structures: Leveraging Semantic Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03079-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T17:06:37Z","timestamp":1558458397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03079-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030789","9783642030796"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03079-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}