Sciweavers

471 search results - page 12 / 95
» Modals As A Problem For MT
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
ANLP
1994
109views more  ANLP 1994»
14 years 11 months ago
Symmetric Pattern Matching Analysis for English Coordinate Structures
The authors propose a model for analyzing English sentences including coordinate conjunctions such as "and","or","but" and the equivalent words. Synt...
Akitoshi Okumura, Kazunori Muraki
JAPLL
2010
133views more  JAPLL 2010»
14 years 8 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
CONCUR
2004
Springer
15 years 1 months ago
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
Antonín Kucera, Ph. Schnoebelen
DALT
2008
Springer
14 years 11 months ago
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
We propose a variant of alternating time temporal logic (ATL) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be ...
Dimitar P. Guelev, Catalin Dima