Skip to main content
SpringerLink
Log in

A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checking are formulated in terms of modal logic and an algorithm for their solution is provided. An axiomatization for a restricted graded modal language with intersection of modalities (the modal counterpart of the concept language we examine)is given and used in the proposed algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Columbia University, 500 W. 120th Street, MC 0401, New York, NY, 10027, U.S.A.

    Ani Nenkova

Authors
  1. Ani Nenkova
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nenkova, A. A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages. Journal of Logic, Language and Information 11, 67–77 (2002). https://doi.org/10.1023/A:1013097911573

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013097911573

Search

Navigation