2 search results - page 1 / 1 » randoCoP: Randomizing the Proof Search Order in the Connecti... |
CADE
2008
Springer
14 years 7 months 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...
ICFP
2000
ACM
13 years 12 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...