4617 search results - page 625 / 924 » Automation of Diagrammatic Reasoning |
230
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
230
Voted
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
214
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
We address the problem of merging qualitative constraint networks (QCNs) representing agents local preferences or beliefs on the relative position of spatial or temporal entities. ...
176
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
186
Voted
RR
2010
Springer
15 years 5 months ago
2010
Springer
For multimedia interpretation, and in particular for the combined interpretation of information coming from different modalities, a semantically well-founded formalization is requ...