226 search results - page 32 / 46 » Extensional Theories and Rewriting |
110
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
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 rest...
116
Voted
GG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
93
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
CADE
2002
Springer
16 years 23 days ago
2002
Springer
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
87
Voted
CORR
1998
Springer
15 years 4 days ago
1998
Springer
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994 , the n...