236 search results - page 7 / 48 » Automated Generation of Interesting Theorems |
SYNASC
2006
IEEE
14 years 1 months ago
2006
IEEE
In the eld of automated reasoning, one of the most challenging (even if, perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst al...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
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...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
ASE
2006
13 years 7 months ago
2006
Finite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state m...