1818 search results - page 253 / 364 » Granularity-Adaptive Proof Presentation |
119
Voted
ISW
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
126
Voted
CADE
2001
Springer
16 years 3 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
108
Voted
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
146
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
125
Voted
GCC
2003
Springer
15 years 8 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...