4573 search results - page 247 / 915 » Automated Reasoning |
167
click to vote
CADE
2007
Springer
16 years 7 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.
136
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
135
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.
177
click to vote
ICCBR
1997
Springer
15 years 10 months ago
1997
Springer
Realistic and complex planning situations require a mixed-initiative planning framework in which human and automated planners interact to mutually construct a desired plan. Ideally...
210
click to vote
ICCBR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Case-Based Reasoning (CBR) solves problems by reusing past problemsolving experiences maintained in a casebase. The key CBR knowledge container therefore is its casebase....