80 search results - page 8 / 16 » On the Complexity of Reasoning in Kleene Algebra |
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
CADE
2004
Springer
14 years 7 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
ISOLA
2010
Springer
13 years 6 months ago
2010
Springer
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
IJCAI
2007
13 years 9 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
CAV
2008
Springer
13 years 9 months ago
2008
Springer
This paper proposes a new approach for proving arithmetic correctness of data paths in System-on-Chip modules. It complements existing techniques which are, for reasons of complexi...