3658 search results - page 93 / 732 » The logic of proofs, semantically |
CADE
2007
Springer
14 years 10 months ago
2007
Springer
We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.
CADE
2004
Springer
14 years 10 months ago
2004
Springer
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.
CADE
2008
Springer
14 years 10 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...
LFCS
1992
Springer
14 years 2 months ago
1992
Springer
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
FUZZIEEE
2007
IEEE
14 years 4 months ago
2007
IEEE
— The Semantic Web can be viewed as largely about “Knowledge meets the Web”. Thus its vision includes ontologies and rules. A key requirement for the architecture of the Sema...