In classical logic, existential and universal quantifiers express that there exists at least one individual satisfying a formula, or that all individuals satisfy a formula. In many logics, these quantifiers have been generalized to express that, for a non-negative integer n, at least n individuals or all but n individuals satisfy a formula. In modal logics, graded modalities generalize standard existential and universal modalities in that they express, e.g., that there exist at least n accessible worlds satisfying a certain formula. Graded modalities are useful expressive means in knowledge representation; they are present in a variety of other knowledge representation formalisms closely related to modal logic. Anatural question that arises is howthe generalization of the existential and universal modalities affects the satisfiability problem for the logic and its computational complexity, especially when the numbers in the graded modalities are coded in binary. In this paper we study the graded μ-calculus, which extends graded modal logic with fixed-point operators, or, equivalently, extends classical μ-calculus with graded modalities.We prove that the satisfiability problem for graded μ-calculus is EXPTIME-complete -not harder than the satisfiability problem for μ-calculus, even when the numbers in the graded modalities are coded in binary.
|Original language||American English|
|Title of host publication||Automated Deduction - CADE-18 - 18th International Conference on Automated Deduction, Proceedings|
|Number of pages||15|
|ISBN (Print)||3540439315, 9783540439318|
|State||Published - 2002|
|Event||18th International Conference on Automated Deduction, CADE 2002 - Copenhagen, Denmark|
Duration: 27 Jul 2002 → 30 Jul 2002
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||18th International Conference on Automated Deduction, CADE 2002|
|Period||27/07/02 → 30/07/02|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.