2519 search results - page 245 / 504 » Reasoning with Textual Cases |
314
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
140
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
179
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We introduce an optimization framework called prioritized optimization control, in which a nested sequence of objectives are optimized so as not to conflict with higher-priori...
140
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
147
click to vote
LICS
2007
IEEE
16 years 28 days ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...