Sciweavers

39 search results - page 3 / 8
» Ordering Constraints over Feature Trees Expressed in Second-...
Sort
View
108
Voted
AIML
2008
14 years 11 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto
129
Voted
MST
2011
206views Hardware» more  MST 2011»
14 years 5 months ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
Manfred Droste, Heiko Vogler
81
Voted
RTA
2005
Springer
15 years 3 months ago
Automata and Logics for Unranked and Unordered Trees
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
Iovka Boneva, Jean-Marc Talbot
110
Voted
CONCUR
2006
Springer
15 years 6 days ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
LICS
2006
IEEE
15 years 4 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Martin Otto