Conference item icon

Conference item

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

Abstract:

Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations such as \"It is true at no fewer than 15 accessible worlds that...\", or \"It is true at no more than 2 accessible worlds that...\". We investigate the complexity of satisfiability for this language over some familiar classes of frames. Thi...

Expand abstract

Actions


Access Document


Files:

Authors


Yevgeny Kazakov More by this author
Ian Pratt−Hartmann More by this author
Publisher:
IEEE Computer Society
ISSN:
1043-6871
URN:
uuid:3d9fc7c2-be0e-4214-9055-99a6ff95db55
Local pid:
cs:3138
ISBN:
978-0-7695-3746-7

Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP