Sciweavers

193 search results - page 10 / 39
» Automated Reasoning in Kleene Algebra
Sort
View
LICS
2000
IEEE
15 years 4 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
CSL
2010
Springer
15 years 26 days ago
Formal Theories for Linear Algebra
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
Stephen Cook, Lila Fontes
CADE
2007
Springer
16 years 2 days ago
Combining Deduction and Algebraic Constraints for Hybrid System Analysis
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
André Platzer
TIME
2008
IEEE
15 years 6 months ago
Moving Spaces
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...
Ivo Düntsch, Michael Winter
CADE
2004
Springer
16 years 2 days ago
Dr.Doodle: A Diagrammatic Theorem Prover
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
Daniel Winterstein, Alan Bundy, Corin A. Gurr