202 search results - page 4 / 41 » Proof Search in Minimal Logic |
ICLP
2010
Springer
13 years 10 months ago
2010
Springer
The proof-theoretic approach to logic programming has benefited from the
CORR
2006
Springer
13 years 6 months ago
2006
Springer
ENTCS
2002
13 years 6 months ago
2002
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...