3228 search results - page 453 / 646 » Computationally Sound Proofs |
91
Voted
AAAI
1990
15 years 4 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
108
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
136
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
100
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relationa...
133
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...