2 search results - page 1 / 1 » randoCoP: Randomizing the Proof Search Order in the Connecti... |
90
Voted
CADE
2008
Springer
16 years 23 days ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
106
Voted
ICFP
2000
ACM
15 years 4 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...