1410 search results - page 66 / 282 » Proving theorems by reuse |
131
click to vote
CIIA
2009
15 years 3 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
141
click to vote
EC
2006
15 years 1 months ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
105
click to vote
IGPL
2008
15 years 1 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
129
click to vote
JCT
2008
15 years 1 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
CADE
2004
Springer
16 years 2 months ago
2004
Springer
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first-order Automated Theorem Proving systems. CASC-18 was the seventh competition in the CASC se...