846 search results - page 107 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
169
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
168
click to vote
CF
2005
ACM
15 years 8 months ago
2005
ACM
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...
188
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
181
click to vote
ICIC
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. In this paper our original methodology of applying ontologybased logic into decision support system for security management in heterogeneous networks is presented. Such d...
158
click to vote
COMPSAC
2006
IEEE
16 years 7 days ago
2006
IEEE
Modern mobile computing paradigms have set new challenges for the development of distributed mobile applications and services. Because of the variability which characterizes the c...