265 search results - page 50 / 53 » How to Prove Inductive Theorems |
161
click to vote
SIGCSE
2002
ACM
15 years 3 months ago
2002
ACM
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propo...
189
click to vote
ICLP
2011
Springer
14 years 7 months ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
138
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
129
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
142
click to vote
FMCAD
2006
Springer
15 years 7 months ago
2006
Springer
We describe a link between the ACL2 and HOL mechanical proof assistants that enables the strengths of each system to be deployed smoothly within a single formal development. Severa...