Sciweavers

500 search results - page 17 / 100
» ACD Term Rewriting
Sort
View
FSTTCS
2008
Springer
13 years 8 months ago
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
Georg Moser, Andreas Schnabl, Johannes Waldmann
ATAL
2006
Springer
13 years 11 months ago
Prototyping 3APL in the Maude term rewriting language
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...
M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Da...
CADE
2001
Springer
14 years 7 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain
DBSEC
2007
131views Database» more  DBSEC 2007»
13 years 8 months ago
Dynamic Event-Based Access Control as Term Rewriting
Abstract. Despite the widespread adoption of Role-based Access Control (RBAC) models, new access control models are required for new applications for which RBAC may not be especial...
Clara Bertolissi, Maribel Fernández, Steve ...
COLING
1992
13 years 8 months ago
Term-Rewriting As A Basis For A Uniform Architecture In Machine Translation
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
Wilhelm Weisweber