Publications

Most of my works are listed in DBLP or Google Scholar. If you weren't successful you can have a look down here. Goodluck! I will be adding some preprints as I find some time to do so.


Books and Proceedings

  • Diana Cristea, Florence Le Ber, Rokia Missaoui, Léonard Kwuida, Baris Sertkaya: Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25-28, 2019. CEUR Workshop Proceedings 2378, CEUR-WS.org 2019

  • L. Kwuida and B. Sertkaya (Eds). Formal Concept Analysis. 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010, Procedings. Series: Lecture Notes in Computer Science, Vol. 5986. Springer (2010)

  • L. Kwuida. Dicomplemented Lattices. A contextual generalization of Boolean algebras. Dissertation TU Dresden. Shaker Verlag (2004). pdf

  • B. Ganter and L. Kwuida (Eds) Contributions to ICFCA 2006. Verlag Allgemeine Wissenschaft (2006).


In Refereed Journals

  • Leonard Kwuida, Rostand S. Kuitché, Romuald E.A. Temgoua: On the size of existencial generalized concept lattices. Discrete Applied Mathematics. Online, April 9,2019.

  • Léonard Kwuida: A single axiom for Boolean algebras. Discrete Applied Mathematics 249: 85-90 (2018)

  • Abdélilah Balamane, Rokia Missaoui, Léonard Kwuida, Jean Vaillancourt: Descriptive group detection in two-mode data networks using biclustering. ASONAM 2016: 744-749

  • L. Kwuida, R. Missaoui, A. Balamane, J. Vaillancourt. Generalized Pattern Extraction from Concept Lattices. Annals of Mathematics and Artificial Intelligence 72(1-2) 151-168 (2014).

  • L. Kwuida and S.E. Schmidt. Valuations and closure operators on finite lattices. Discrete Applied Mathematics. Vol 159, Issue 10. (2011)

  • L. Kwuida and E. Lehtonen. On the homomorphism order of labeled posets. Order. Vol 28. No 2 (2011)

  • L. Kwuida and H. Machida. On the isomorphism problem of weakly dicomplemented lattices. Annals of Mathematics and Artificial Intelligence (2010)

  • L. Kwuida. Prime ideal theorem for double Boolean algebras. Discussiones Mathematicae General Algebra and Applications. Vol. 27 No. 2 (2007). 263-275.

  • B. Ganter and L. Kwuida. Finite distributive concept algebras.Order Vol. 23, No. 2-3 (2006) 235-248.

  • L. Kwuida, C. Pech and H. Reppe. Generalizations of Boolean algebras. An attribute exploration. Mathematica Slovaca Vol. 56 No. 2 (2006) 145-165.ps

  • L. Kwuida. Congruence of concept algebras. Novi Sad Journal of Mathematics Vol. 34 No. 2 (2004) 141-152.


In Refereed Conference Proceedings

  • L. Kwuida, R. Missaoui, J. Vaillancourt. Using Taxonomies on Objects and Attributes to Discover Generalized Patterns. CLA 2012: 327-338

  • R. Missaoui, L. Kwuida: Mining Triadic Association Rules from Ternary Relations. ICFCA 2011: 204-218

  • L. Kwuida, R. Missaoui, B. Ben Amor, L. Boumedjout, J. Vaillancourt, Restrictions on Concept Lattices for Pattern Management. In proceedings of CLA 2010. S. Obiedkov and M. Kryszkiewicz (eds.) (2010) 235-246

  • R. Missaoui and L. Kwuida. What can Formal Concept Analysis do for Data Warehouses? In S. Ferré and S. Rudolph (Eds.) Formal Concept Analysis. 7th International Conference, ICFCA 2009, Darmstadt, Germany, May 2009, Proceedings. LNAI 5548. Springer (2009) 58-65.

  • R. Missaoui, L. Kwuida, M. Quafafou and J. Vaillancourt. Algebraic operators for querying pattern bases. In K. E. Wol., S. Ferr.e and S. Rudolph (Eds.) Contributions to ICFCA 2009. 7th International Conference on Formal Concept Analysis, ICFCA 2009. Darmstadt, Germany, May 21-24, 2009. 1-17.

  • L. Kwuida and H. Machida. On the isomorphism problem of weakly dicomplemented lattices. Proceedings of the 6th international conference on concept lattices and their applications CLA2008. Radim Belohlavek and Sergei O. Kuznetsov (Eds) Palack.y University, Olomouc, Czech Republic (2008) 217-228.

  • L. Kwuida. On concept lattice approximation. In Osamu Watanabe (Ed.) Foundations of Theoretical Computer Science: For New Computational View. RIMS No. 1599, Proceedings of the LA Symposium, January 28-30, 2008, Kyoto, Japan, (2008) 42-50.

  • L. Kwuida, B. Seselja and A. Tepavcevic. On the MacNeille completion of weakly dicomplemented lattices. LNAI 4390 Springer (2007) 271-280.

  • L. Kwuida. A note on negation: a pcs-completion of semilattices. LNAI 3874 Springer (2006) 146-160.

  • B. Ganter and L. Kwuida. Which concept lattices are pseudocomplemented? LNCS 3403 Springer (2005) 407-415.

  • L. Kwuida, A. Tepavcevic and B. Seselja. Negation in contextual logic. LNAI 3127 Springer (2004) 227-241.

  • L. Kwuida. The varieties of weakly dicomplemented lattices generated by chains. Contributions to General Algebra 15, J. Heyn, Klagenfurt (2004) 63-72.

  • L. Kwuida. When is a concept algebra Boolean? LNAI 2961 Springer (2004) 142-155.

  • B. Ganter and Leonard Kwuida. Representable weak dicomplementations on finite lattices. Contributions to General Algebra 14, J. Heyn, Klagenfurt (2004) 63-72.

  • L. Kwuida and B. Ganter. Closure operators with cost functions in M. Liquiere (Editor) Advance in Formal Concept Analysis for Knowledge Discovery in Databases FCAKDD2002. ECAI2002 International Workshop, LyonJuly 23 2002. (2002) 44-53.

Research Reports

  • L. Kwuida and E. Lehtonen. On the homomorphism order of labeled posets ArXiv:0911.0200 (2009)

  • L. Kwuida. Axiomatization of Boolean algebras via weak dicomplementations. ArXiv: 0907.1279 (2009)

  • L. Kwuida, R. Missaoui, L. Boumedjout and J. Vaillancourt. Mining Generalized Patterns from Large Databases using Ontologies. CoRR abs/0905.4713 (May 2009)

  • R. Missaoui, L. Kwuida, M. Quafafou and J. Vaillancourt. Algebraic operators for querying pattern bases. CoRR abs/0902.4042: (February 2009)

  • L. Kwuida and Stefan Schmidt. Valuations and closure operators on finite lattices. MATH-AL-01-2008. January 2008. 14 pages.

  • L. Kwuida, C. Pech and H. Reppe. Generalizations of Boolean algebras. An attribute exploration. MATH-AL-02-2004. December 2004. 25 pages.

  • L. Kwuida. Weakly dicomplemented lattices, Boolean algebras and double p-algebras. MATH-AL-05-2003. Mai 2003. 24 pages.

  • B. Ganter and L. Kwuida. Dicomplemented lattices: towards a representation theorem. MATH-AL-20-2002. December 2002. 17 pages.

  • B. Ganter and L. Kwuida. Representing weak dicomplementations. MATH-AL-20-2002. July 2002. 19 pages.