Skip to main content
SpringerLink
Log in

Negation, Opposition, and Possibility in Logical Concept Analysis

  • Conference paper
Formal Concept Analysis

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3874))

Abstract

We introduce the epistemic extension, a logic transformation based on the modal logic AIK (All I Know) for use in the framework of Logical Concept Analysis (LCA). The aim is to allow for the distinction between negation, opposition, and possibility in a unique formalism. The difference between negation and opposition is examplified by the difference between “young/not young” and “young/old”. The difference between negation and possibility is examplified by the difference between “(certainly) not young” and “possibly not young”. Furthermore this epistemic extension entails no loss of genericity in LCA.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burmeister, P., Holzer, R.: Treating incomplete knowledge in formal concept analysis. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 114–126. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Bowen, K.A.: Model Theory for Modal Logic. D. Reidel, London (1979)

    MATH  Google Scholar 

  3. Chen, J.: The logic of only knowing as a unified framework for non-monotonic reasoning. Fundamenta Informatica 21 (1994)

    Google Scholar 

  4. Chaudron, L., Maille, N.: Generalized formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Donini, F.M., Nardi, D., Rosati, R.: Autoepistemic description logics. In: IJCAI (1997)

    Google Scholar 

  6. Ferré, S.: Complete and incomplete knowledge in logical information systems. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 782–791. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Ferré, S.: Systèmes d’information logiques : un paradigme logico-contextuel pour interroger, naviguer et apprendre. Thèse d’université, Université de Rennes 1 (October 2002), Accessible en ligne á l’adresse, http://www.irisa.fr/bibli/publi/theses/theses02.html

  8. Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 371–384. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Ferré, S., Ridoux, O.: A framework for developing embeddable customized logics. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol. 2372, pp. 191–215. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Ferré, S., Ridoux, O.: An introduction to logical information systems. Information Processing & Management 40(3), 383–419 (2004)

    Article  MATH  Google Scholar 

  11. Ganter, B., Kuznetsov, S.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 129–142. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Janton, P., Tonkin, H.: Esperanto: Language, Literature, and Community. State University of New York Press (1993)

    Google Scholar 

  13. Kaneiwa, K.: Negations in description logic - contraries, contradictories, and subcontraries. In: Dau, F., Mugnier, M.-L., Stumme, G. (eds.) Contributions to ICCS 2005, pp. 66–79. Kassel University Press GmbH (2005)

    Google Scholar 

  14. Levesque, H.: All I know: a study in autoepistemic logic. Artificial Intelligence 42(2) (March 1990)

    Google Scholar 

  15. Lifschitz, V.: Nonmonotonic databases and epistemic queries. In: 12th International Joint Conference on Artificial Intelligence, pp. 381–386 (1991)

    Google Scholar 

  16. McCarthy, J.: Applications of circumscription to formalizing common sense knowledge. Artificial Intelligence 28(1) (1986)

    Google Scholar 

  17. Moore, R.C.: Semantical considerations on nonmonotonic logic. Artificial Intelligence 25(1), 75–94 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  18. Obiedkov, S.A.: Modal logic for evaluating formulas in incomplete contexts. In: Priss, U., Corbett, D.R., Angelova, G. (eds.) ICCS 2002. LNCS (LNAI), vol. 2393, pp. 314–325. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Plotkin, G.D.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)

    MathSciNet  Google Scholar 

  20. Prediger, S.: Logical scaling in formal concept analysis. LNCS, vol. 1257, pp. 332–341. Springer, Heidelberg (1997)

    Google Scholar 

  21. Rosati, R.: Tableau calculus for only knowing and knowing at most. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Wille, R.: Boolean concept logic. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 317–331. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Irisa/Université de Rennes 1, Campus de Beaulieu, 35042 cedex, Rennes, France

    Sébastien Ferré

Authors
  1. Sébastien Ferré
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Département d’informatique et d’ingénierie, Université du Québec en Outaouais, succursale B, C.P. 1250, J8X 3X7, Gatineau, Québec, Canada

    Rokia Missaoui

  2. Mathematisches Institut, Universität Bern, Sidlerstr. 5, 3012, Bern, Switzerland

    Jürg Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferré, S. (2006). Negation, Opposition, and Possibility in Logical Concept Analysis. In: Missaoui, R., Schmidt, J. (eds) Formal Concept Analysis. Lecture Notes in Computer Science(), vol 3874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671404_9

Download citation

  • DOI: https://doi.org/10.1007/11671404_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32203-0

  • Online ISBN: 978-3-540-32204-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation