1410 search results - page 127 / 282 » Proving theorems by reuse |
282
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
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...
129
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
161
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
188
click to vote
FOSSACS
2010
Springer
16 years 24 days ago
2010
Springer
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
149
click to vote
COCO
2009
Springer
16 years 16 days ago
2009
Springer
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...