498 search results - page 59 / 100 » Term Rewriting |
138
click to vote
NTMS
2008
IEEE
15 years 9 months ago
2008
IEEE
—We propose an access control model that extends RBAC (Role-Based Access Control) to take time and location into account, and use term rewriting systems to specify access control...
134
click to vote
RTA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
147
click to vote
ESSLLI
2009
Springer
15 years 28 days ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
142
click to vote
IANDC
2011
14 years 10 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
111
click to vote
SIGIR
2010
ACM
15 years 3 months ago
2010
ACM
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...