23201 search results - page 362 / 4641 » Rewriting Systems with Data |
199
click to vote
MMMACNS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
200
click to vote
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
180
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
In this paper we present a mechanism for translating constraint queries, i.e., Boolean expressions of constraints, across heterogeneous information sources. Integrating such syste...
165
click to vote
LACL
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
136
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...