Back to Search

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
Collapse abstract

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Kazakov, Y., & Pratt−Hartmann, I. (2015). A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics.

MLA Style

Kazakov, Y., and I. Pratt−Hartmann. A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. IEEE, 2015.

Chicago Style

Kazakov, Y, and I Pratt−Hartmann. 2015. “A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics.” In . IEEE.
Tweet
Print

Access Document

Files:: gml-lics.pdf

(pdf, 288.1KB)

Authors

+ Kazakov, Y More by this author

Role:

Author

+ Pratt−Hartmann, I More by this author

Role:

Author

Bibliographic Details

Publisher:: IEEE
Host title:: Proc. of LICS 2009
ISSN:: 1043-6871
ISBN:: 9780769537467

Item Description

UUID:: uuid:3d9fc7c2-be0e-4214-9055-99a6ff95db55
Local pid:: cs:3138
Deposit date:: 2015-03-31

Metrics

Views and Downloads

About views and downloads

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

TO TOP