33 search results - page 3 / 7 » Reasoning with Past to Prove PKCS |
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
CADE
1994
Springer
13 years 8 months ago
1994
Springer
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...
CSL
2006
Springer
13 years 8 months ago
2006
Springer
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
EWCBR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
ICLP
2009
Springer
14 years 5 months ago
2009
Springer
As a novel, grand AI challenge, General Game Playing is concerned with the development of systems that understand the rules of unknown games and play these games well without human...