882 search results - page 49 / 177 » A Taste of Rewrite Systems |
CAINE
2001
13 years 9 months ago
2001
In this paper, we describe the theoretical framework that allows us to use of the expert system shell CLIPS to define the network model in the Distribution Management System (DMS)...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
FOSSACS
2001
Springer
14 years 3 days ago
2001
Springer
The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting...
FORTE
2010
13 years 9 months ago
2010
Abstract. Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries li...
IANDC
2011
13 years 2 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...