804 search results - page 89 / 161 » On the Termination of the Chase Algorithm |
104
click to vote
CCS
2008
ACM
15 years 2 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
125
click to vote
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
99
Voted
ACL
2003
15 years 2 months ago
2003
This paper presents a method for unsupervised discovery of semantic patterns. Semantic patterns are useful for a variety of text understanding tasks, in particular for locating ev...
IJCAI
1997
15 years 1 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
129
Voted
IWMMDBMS
1996
15 years 1 months ago
1996
We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constr...