1385 search results - page 93 / 277 » Natural Rewriting for General Term Rewriting Systems |
184
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
Most declarative SQL-like query languagesfor object-oriented database systems (OOSQL) are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-,...
147
click to vote
ENTCS
2008
15 years 6 months ago
2008
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
146
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
171
click to vote
AAAI
2011
14 years 6 months ago
2011
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
149
click to vote
RTA
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...