A PSPACE algorithm for graded modal logic (1999) [16 citations — 8 self]
by Stephan Tobies
In Proc. of CADE-16, LNCS
ftp://www-lti.informatik.rwth-aachen.de/pub/papers/1999/Tobies-CADE-99.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Tobies99apspace,author = {Stephan Tobies},
title = {A PSPACE algorithm for graded modal logic},
booktitle = {In Proc. of CADE-16, LNCS},
year = {1999},
pages = {52--66},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Abstract:
Abstract. 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 a ExpTime-hardness conjecture. This establishes a kind of "theoretical benchmark " that all algorithmic approaches can be measured with. c fl Springer-Verlag
