메뉴 건너뛰기




Volumn 159, Issue 6, 2011, Pages 450-466

On the complexity of enumerating pseudo-intents

Author keywords

Complexity; Duquenne Guigues Base; Formal concept analysis; Implications; Pseudo intents

Indexed keywords

COMPLEXITY; DUQUENNE-GUIGUES BASE; FORMAL CONCEPT ANALYSIS; IMPLICATIONS; PSEUDO-INTENTS;

EID: 79551548430     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.12.004     Document Type: Article
Times cited : (65)

References (43)
  • 2
    • 0003878763 scopus 로고
    • Elsevier Science Publishers B.V., North Holland
    • C. Berge Hypergraphs 1989 Elsevier Science Publishers B.V., North Holland
    • (1989) Hypergraphs
    • Berge, C.1
  • 3
    • 49949100800 scopus 로고    scopus 로고
    • About keys of formal context and conformal hypergraph
    • Proceedings of the 6th International Conference on Formal Concept Analysis ICFCA 2008
    • P. Colomb, and L. Nourine About keys of formal context and conformal hypergraph R. Medina, S.A. Obiedkov, Proceedings of the 6th International Conference on Formal Concept Analysis ICFCA 2008 Lecture Notes in Computer Science vol. 4933 2008 Springer-Verlag 140 149
    • (2008) Lecture Notes in Computer Science , vol.4933 , pp. 140-149
    • Colomb, P.1    Nourine, L.2
  • 4
    • 78650412273 scopus 로고    scopus 로고
    • Hardness of enumerating pseudo-intents in the lectic order
    • Proceedings of the 8th International Conference on Formal Concept Analysis ICFCA 2010
    • F. Distel Hardness of enumerating pseudo-intents in the lectic order L. Kwuida, B. Sertkaya, Proceedings of the 8th International Conference on Formal Concept Analysis ICFCA 2010 Lecture Notes in Artificial Intelligence vol. 5986 2010 Springer-Verlag 124 137
    • (2010) Lecture Notes in Artificial Intelligence , vol.5986 , pp. 124-137
    • Distel, F.1
  • 5
    • 0021509216 scopus 로고
    • Linear-time algorithms for testing the satisfiability of propositional Horn formulae
    • W.F. Dowling, and J.H. Gallier Linear-time algorithms for testing the satisfiability of propositional Horn formulae Journal of Logic Programming 3 1984 267 284
    • (1984) Journal of Logic Programming , vol.3 , pp. 267-284
    • Dowling, W.F.1    Gallier, J.H.2
  • 6
    • 0001123452 scopus 로고
    • The core of finite lattices
    • V. Duquenne The core of finite lattices Discrete Mathematics 88 1991 133 147
    • (1991) Discrete Mathematics , vol.88 , pp. 133-147
    • Duquenne, V.1
  • 8
    • 0000251093 scopus 로고
    • Identifying the minimal transversals of a hypergraph and related problems
    • T. Eiter, and G. Gottlob Identifying the minimal transversals of a hypergraph and related problems SIAM Journal on Computing 24 6 1995 1278 1304
    • (1995) SIAM Journal on Computing , vol.24 , Issue.6 , pp. 1278-1304
    • Eiter, T.1    Gottlob, G.2
  • 9
    • 77952047112 scopus 로고    scopus 로고
    • Hypergraph transversal computation and related problems in logic and AI
    • Proceedings of the European Conference on Logics in Artificial Intelligence JELIA 2002
    • T. Eiter, and G. Gottlob Hypergraph transversal computation and related problems in logic and AI S. Flesca, S. Greco, N. Leone, G. Ianni, Proceedings of the European Conference on Logics in Artificial Intelligence JELIA 2002 Lecture Notes in Computer Science vol. 2424 2002 Springer-Verlag 549 564
    • (2002) Lecture Notes in Computer Science , vol.2424 , pp. 549-564
    • Eiter, T.1    Gottlob, G.2
  • 11
    • 0038049065 scopus 로고    scopus 로고
    • New results on monotone dualization and generating hypergraph transversals
    • T. Eiter, G. Gottlob, and K. Makino New results on monotone dualization and generating hypergraph transversals SIAM Journal on Computing 32 2 2003 514 537
    • (2003) SIAM Journal on Computing , vol.32 , Issue.2 , pp. 514-537
    • Eiter, T.1    Gottlob, G.2    Makino, K.3
  • 12
    • 47549090600 scopus 로고    scopus 로고
    • Computational aspects of monotone dualization: A brief survey
    • T. Eiter, K. Makino, and G. Gottlob Computational aspects of monotone dualization: a brief survey Discrete Applied Mathematics 156 11 2008 2035 2049
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.11 , pp. 2035-2049
    • Eiter, T.1    Makino, K.2    Gottlob, G.3
  • 13
    • 0000039971 scopus 로고    scopus 로고
    • On the complexity of dualization of monotone disjunctive normal forms
    • M.L. Fredman, and L. Khachiyan On the complexity of dualization of monotone disjunctive normal forms Journal of Algorithms 21 3 1996 618 628
    • (1996) Journal of Algorithms , vol.21 , Issue.3 , pp. 618-628
    • Fredman, M.L.1    Khachiyan, L.2
  • 15
    • 78650367081 scopus 로고    scopus 로고
    • Two basic algorithms in concept analysis
    • Proceedings of the 8th International Conference on Formal Concept Analysis ICFCA 2010
    • B. Ganter Two basic algorithms in concept analysis L. Kwuida, B. Sertkaya, Proceedings of the 8th International Conference on Formal Concept Analysis ICFCA 2010 Lecture Notes in Artificial Intelligence vol. 5986 2010 Springer-Verlag 329 359 Reprint of [14]
    • (2010) Lecture Notes in Artificial Intelligence , vol.5986 , pp. 329-359
    • Ganter, B.1
  • 18
    • 26844438133 scopus 로고    scopus 로고
    • Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases
    • Proceedings of the 3rd International Conference on Formal Concept Analysis ICFCA 2005
    • A. Gly, R. Medina, L. Nourine, and Y. Renaud Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases B. Ganter, R. Godin, Proceedings of the 3rd International Conference on Formal Concept Analysis ICFCA 2005 Lecture Notes in Computer Science vol. 3403 2005 Springer-Verlag 235 248
    • (2005) Lecture Notes in Computer Science , vol.3403 , pp. 235-248
    • Gly, A.1    Medina, R.2    Nourine, L.3    Renaud, Y.4
  • 19
    • 33745564339 scopus 로고    scopus 로고
    • About the family of closure systems preserving non-unit implications in the Guigues-Duquenne base
    • Proceedings of the 4th International Conference on Formal Concept Analysis ICFCA 2006
    • A. Gly, and L. Nourine About the family of closure systems preserving non-unit implications in the Guigues-Duquenne base R. Missaoui, J. Schmid, Proceedings of the 4th International Conference on Formal Concept Analysis ICFCA 2006 Lecture Notes in Computer Science vol. 3874 2006 Springer-Verlag 191 204
    • (2006) Lecture Notes in Computer Science , vol.3874 , pp. 191-204
    • Gly, A.1    Nourine, L.2
  • 20
    • 0002819235 scopus 로고
    • Familles minimales d'implications informatives resultant d'un tableau de donnes binaries
    • J.-L. Guigues, and V. Duquenne Familles minimales d'implications informatives resultant d'un tableau de donnes binaries Mathmatiques, Informatique et Sciences Humaines 95 1986 5 18
    • (1986) Mathmatiques, Informatique et Sciences Humaines , vol.95 , pp. 5-18
    • Guigues, J.-L.1    Duquenne, V.2
  • 23
    • 33745421527 scopus 로고    scopus 로고
    • Minimum implicational basis for meet-semidistributive lattices
    • P. Janssen, and L. Nourine Minimum implicational basis for meet-semidistributive lattices Information Processing Letters 99 5 2006 199 202
    • (2006) Information Processing Letters , vol.99 , Issue.5 , pp. 199-202
    • Janssen, P.1    Nourine, L.2
  • 25
    • 85029658993 scopus 로고
    • On Horn envelopes and hypergraph transversals
    • 4th International Symposium on Algorithms and Computation ISAAC'93
    • D.J. Kavvadias, C.H. Papadimitriou, and M. Sideri On Horn envelopes and hypergraph transversals K.-W. Ng, P. Raghavan, N.V. Balasubramanian, F.Y.L. Chin, 4th International Symposium on Algorithms and Computation ISAAC'93 Lecture Notes in Computer Science vol. 762 1993 Springer-Verlag 399 405
    • (1993) Lecture Notes in Computer Science , vol.762 , pp. 399-405
    • Kavvadias, D.J.1    Papadimitriou, C.H.2    Sideri, M.3
  • 29
    • 23844496680 scopus 로고    scopus 로고
    • On the intractability of computing the DuquenneGuigues base
    • S.O. Kuznetsov On the intractability of computing the DuquenneGuigues base Journal of Universal Computer Science 10 8 2004 927 933
    • (2004) Journal of Universal Computer Science , vol.10 , Issue.8 , pp. 927-933
    • Kuznetsov, S.O.1
  • 30
    • 33745538807 scopus 로고    scopus 로고
    • Counting pseudo-intents and P-completeness
    • Proceedings of the 4th International Conference on Formal Concept Analysis ICFCA 2006
    • S.O. Kuznetsov, and S.A. Obiedkov Counting pseudo-intents and P-completeness R. Missaoui, J. Schmid, Proceedings of the 4th International Conference on Formal Concept Analysis ICFCA 2006 Lecture Notes in Computer Science vol. 3874 2006 Springer-Verlag Dresden, Germany 306 308
    • (2006) Lecture Notes in Computer Science , vol.3874 , pp. 306-308
    • Kuznetsov, S.O.1    Obiedkov, S.A.2
  • 31
    • 47549094827 scopus 로고    scopus 로고
    • Some decision and counting problems of the DuquenneGuigues basis of implications
    • S.O. Kuznetsov, and S.A. Obiedkov Some decision and counting problems of the DuquenneGuigues basis of implications Discrete Applied Mathematics 156 11 2008 1994 2003
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.11 , pp. 1994-2003
    • Kuznetsov, S.O.1    Obiedkov, S.A.2
  • 32
    • 0000203994 scopus 로고
    • Generating all maximal independent sets: NP-hardness and polynomial time algorithms
    • E. Lawler, J. Lenstra, and A.R. Kan Generating all maximal independent sets: NP-hardness and polynomial time algorithms SIAM Journal on Computing 9 1980 558 565
    • (1980) SIAM Journal on Computing , vol.9 , pp. 558-565
    • Lawler, E.1    Lenstra, J.2    Kan, A.R.3
  • 34
    • 79551546439 scopus 로고    scopus 로고
    • Efficient algorithms for clone items detection
    • Proceedings of the 2005 International Workshop on Concept Lattices and their Applications CLA 2005
    • R. Medina, C. Noyer, and O. Raynauld Efficient algorithms for clone items detection R. Belohlavek, V. Snasel, Proceedings of the 2005 International Workshop on Concept Lattices and their Applications CLA 2005 CEUR Workshop Proceedings vol. 162 2005
    • (2005) CEUR Workshop Proceedings , vol.162
    • Medina, R.1    Noyer, C.2    Raynauld, O.3
  • 37
    • 38049023500 scopus 로고    scopus 로고
    • Some notes on pseudo-closed sets
    • Proceedings of the 5th International Conference on Formal Concept Analysis ICFCA 2007
    • S. Rudolph Some notes on pseudo-closed sets S.O. Kuznetsov, S. Schmidt, Proceedings of the 5th International Conference on Formal Concept Analysis ICFCA 2007 Lecture Notes in Computer Science vol. 4390 2007 Springer-Verlag 151 165
    • (2007) Lecture Notes in Computer Science , vol.4390 , pp. 151-165
    • Rudolph, S.1
  • 38
    • 67650481188 scopus 로고    scopus 로고
    • Some computational problems related to pseudo-intents
    • Proceedings of the 7th International Conference on Formal Concept Analysis ICFCA 2009
    • B. Sertkaya Some computational problems related to pseudo-intents S. Ferr, S. Rudolph, Proceedings of the 7th International Conference on Formal Concept Analysis ICFCA 2009 Lecture Notes in Artificial Intelligence vol. 5548 2009 Springer-Verlag 130 145
    • (2009) Lecture Notes in Artificial Intelligence , vol.5548 , pp. 130-145
    • Sertkaya, B.1
  • 39
    • 76649091235 scopus 로고    scopus 로고
    • Towards the complexity of recognizing pseudo-intents
    • Proceedings of the 17th International Conference on Conceptual Structures ICCS 2009
    • B. Sertkaya Towards the complexity of recognizing pseudo-intents F. Dau, S. Rudolph, Proceedings of the 17th International Conference on Conceptual Structures ICCS 2009 Lecture Notes in Computer Science 2009 Springer-Verlag
    • (2009) Lecture Notes in Computer Science
    • Sertkaya, B.1
  • 41
    • 33745365959 scopus 로고    scopus 로고
    • Optimal implicational bases for finite modular lattices
    • M. Wild Optimal implicational bases for finite modular lattices Quaestiones Mathematicae 23 2000 153 161
    • (2000) Quaestiones Mathematicae , vol.23 , pp. 153-161
    • Wild, M.1
  • 42
    • 0000398336 scopus 로고
    • Restructuring lattice theory: An approach based on hierarchies of concepts
    • R. Wille Restructuring lattice theory: an approach based on hierarchies of concepts I. Rival, Ordered Sets 1982 Reidel Dordrecht, Boston 445 470
    • (1982) Ordered Sets , pp. 445-470
    • Wille, R.1
  • 43
    • 67650348468 scopus 로고    scopus 로고
    • Restructuring lattice theory: An approach based on hierarchies of concepts
    • Proceedings of the 7th International Conference on Formal Concept Analysis ICFCA 2009
    • R. Wille Restructuring lattice theory: an approach based on hierarchies of concepts S. Ferr, S. Rudolph, Proceedings of the 7th International Conference on Formal Concept Analysis ICFCA 2009 Lecture Notes in Artificial Intelligence vol. 5548 2009 Springer-Verlag Reprint of [42]
    • (2009) Lecture Notes in Artificial Intelligence , vol.5548
    • Wille, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.