1385 search results - page 92 / 277 » Natural Rewriting for General Term Rewriting Systems |
157
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
146
click to vote
CALCO
2009
Springer
16 years 23 days ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
173
click to vote
DEXAW
2007
IEEE
16 years 16 days ago
2007
IEEE
The semantic web represents meta-data as a relation of triples using the RDF data model. We have developed a virtual repository system that enables to process queries to RDF views...
175
click to vote
ICALP
2007
Springer
16 years 10 days ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
180
click to vote
TABLEAUX
2009
Springer
15 years 10 months ago
2009
Springer
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...