1888 search results - page 86 / 378 » Proof theory and computational analysis |
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
108
click to vote
CADE
2007
Springer
15 years 6 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
120
click to vote
PR
2008
15 years 13 days ago
2008
One of the objectives of precision agriculture is to minimize the volume of herbicides that are applied to the fields through the use of site-specific weed management systems. Thi...
98
Voted
ENTCS
2008
15 years 22 hour ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
110
Voted
TPHOL
2008
IEEE
15 years 6 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...