Skip Navigation

Journal of Logic and Computation 2001 11(1):85-106; doi:10.1093/logcom/11.1.85
© 2001 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tobies, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

PSPACE Reasoning for Graded Modal Logics

Stephan Tobies1

1 LuFg Theoretical Computer Science, RWTH Aachen, Theoretische Informatik, Ahornstr. 55, D-52074 Aachen, Germany. E-mail: tobies{at}informatik.rwth-aachen.de

We present a PSPACE algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which plays an important role in the area of knowledge representation. The algorithm employs a tableaux approach and is the first known algorithm which meets the lower bound for the complexity of the problem. Thus, we exactly fix the complexity of the problem and refute an EXPTIME-hardness conjecture. We extend the results to the logic Gr(K R{cap}–1, which augments Gr(KR) with inverse relations and intersection of accessibility relations. This establishes a kind of ‘theoretical benchmark’ that all algorithmic approaches can be measured against.

Keywords: Modal logic; graded modalities; counting; description logic; complexity

Accepted 15 October 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.