846 search results - page 31 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
The aim of the paper is to present basic notions related to granular computing, namely the information granule syntax and semantics as well as the inclusion and closeness (similari...
92
Voted
IJAC
2010
14 years 6 months ago
2010
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological c...
CONCUR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
AUTOMATICA
2008
14 years 9 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...