889 search results - page 4 / 178 » Problems in Rewriting III |
BIRTHDAY
2005
Springer
14 years 3 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
AISC
1992
Springer
14 years 1 months ago
1992
Springer
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
AISC
2006
Springer
14 years 1 months ago
2006
Springer
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each ...
ICDT
2010
ACM
14 years 7 months ago
2010
ACM
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
VLDB
1993
ACM
14 years 1 months ago
1993
ACM
III this paper we address the problem of controlling the execution of a query optimizer. We describe a control for the optimization process that is based on planning. The controll...