A Note on the Complexity of the Satisfiability Problem for Graded Modal LogicsReport as inadecuate




A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics - Download this document for free, or read online. Document in PDF available to download.

Reference: Yevgeny Kazakov and Ian Pratt−Hartmann, (2009-00-01). A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics.Citable link to this page:

 

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. This problem is more challenging than its ordinary modal logic counterpart–especially in the case of transitive frames, where graded modal logic lacks the tree-model property. We obtain tight complexity bounds for the problem of determining the satisfiability of a given graded modal logic formula over the classes of frames characterized by any combination of reflexivity, seriality, symmetry, transitivity and the Euclidean property.

Bibliographic Details

Publisher: IEEE Computer Society

Host: Proc. of LICS 2009see more from them

Issue Date: 2009-00-01Identifiers

Urn: uuid:3d9fc7c2-be0e-4214-9055-99a6ff95db55

Isbn: 978-0-7695-3746-7

Issn: 1043-6871 Item Description

Type: Conference paper; Tiny URL: cs:3138

Relationships





Author: Yevgeny Kazakov - - - Ian Pratt−Hartmann - - - - Bibliographic Details Publisher: IEEE Computer Society - - Host: Proc. of LICS

Source: https://ora.ox.ac.uk/objects/uuid:3d9fc7c2-be0e-4214-9055-99a6ff95db55



DOWNLOAD PDF




Related documents