Sciweavers

226 search results - page 32 / 46
» Extensional Theories and Rewriting
Sort
View
LATA
2009
Springer
14 years 3 months ago
Rigid Tree Automata
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...
Florent Jacquemard, Francis Klay, Camille Vacher
GG
2010
Springer
13 years 10 months ago
Local Confluence for Rules with Nested Application Conditions
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 ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...
CIKM
2010
Springer
13 years 7 months ago
Query optimization for ontology-based information integration
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...
Yingjie Li, Jeff Heflin
CADE
2002
Springer
14 years 9 months ago
Basic Syntactic Mutation
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
Christopher Lynch, Barbara Morawska
CORR
1998
Springer
85views Education» more  CORR 1998»
13 years 8 months ago
The Proper Treatment of Optimality in Computational Phonology
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994, the n...
Lauri Karttunen