3573 search results - page 281 / 715 » Reasoning about Codata |
145
click to vote
LICS
1999
IEEE
15 years 9 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
128
click to vote
TIME
1999
IEEE
15 years 9 months ago
1999
IEEE
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...
118
click to vote
ICCBR
1997
Springer
15 years 8 months ago
1997
Springer
This paper describes the dual use of a case base for diagnosis and for improving the design of a manufacturing process. In the short term, the case base is used to provide past ex...
134
click to vote
PLILP
1992
Springer
15 years 8 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
106
click to vote
ICLP
1989
Springer
15 years 8 months ago
1989
Springer
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...