Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

LICS
2006
IEEE

favoriteEmaildiscussreport

128views Automated Reasoning» more LICS 2006»

PSPACE Bounds for Rank-1 Modal Logics

13 years 10 months ago

PSPACE Bounds for Rank-1 Modal Logics

Download tocl.acm.org

aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descriptors: F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic—Modal Logic; Computational Logic; F.2.2. [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—Complexity of Proof Procedures General Terms: Algorithms, Languages, Theory Additional Key Words and Phrases: Shallow models, resolution, coalgebra

Lutz Schröder, Dirk Pattinson

Real-time Traffic

Additional Key Words | Computer Science | LICS 2006 | Mathematical Logic—Modal Logic | Nonnumerical Algorithms |

claim paper

Related Content

» A PSpace Algorithm for Graded Modal Logic

» The craft of model making PSPACE bounds for noniterative modal logics

» A Finite Model Construction for Coalgebraic Modal Logic

» Shallow Models for Noniterative Modal Logics

» Presburger Modal Logic Is PSPACEComplete

» Complexity of modal logics with Presburger constraints

» On the Complexity of Elementary Modal Logics

» The Complexity of Temporal Logic with Until and Since over Ordinals

» Branchingtime Model Checking of Onecounter Processes

Post Info
More Details (n/a)

Added	12 Jun 2010
Updated	12 Jun 2010
Type	Conference
Year	2006
Where	LICS
Authors	Lutz Schröder, Dirk Pattinson

Comments (0)