Sciweavers

12 search results - page 2 / 3
» Modal Logic over Higher Dimensional Automata
Sort
View
LPAR
2005
Springer
13 years 10 months ago
Comparative Similarity, Tree Automata, and Diophantine Equations
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
ECAI
2010
Springer
13 years 5 months ago
Higher-Order Coalition Logic
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}] expressing that the coalition of all agents satisfying (x) can ac...
Guido Boella, Dov M. Gabbay, Valerio Genovese, Lee...
ICTL
1994
13 years 9 months ago
Completeness through Flatness in Two-Dimensional Temporal Logic
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
Yde Venema
LICS
2007
IEEE
13 years 11 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
MST
2011
208views Hardware» more  MST 2011»
12 years 12 months ago
Weighted Picture Automata and Weighted Logics
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...
Ina Fichtner