Sciweavers

1036 search results - page 12 / 208
» Natural Narrowing for General Term Rewriting Systems
Sort
View
JAR
2006
87views more  JAR 2006»
13 years 7 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
ENTCS
2008
131views more  ENTCS 2008»
13 years 7 months ago
Connector Rewriting with High-Level Replacement Systems
Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primi...
Christian Koehler, Alexander Lazovik, Farhad Arbab
CIKM
2003
Springer
14 years 23 days ago
Multi-resolution disambiguation of term occurrences
We describe a system for extracting mentions of terms such as company and product names, in a large and noisy corpus of documents, such as the World Wide Web. Since natural langua...
Einat Amitay, Rani Nelken, Wayne Niblack, Ron Siva...
CCS
2005
ACM
14 years 1 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
EMNLP
2004
13 years 9 months ago
Automatic Analysis of Plot for Story Rewriting
A method for automatic plot analysis of narrative texts that uses components of both traditional symbolic analysis of natural language and statistical machine-learning is presente...
Harry Halpin, Johanna D. Moore, Judy Robertson