351 search results - page 32 / 71 » Algebra and Geometry of Rewriting |
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
PPDP
2007
Springer
14 years 4 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
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...
ENTCS
2006
13 years 10 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
APAL
1999
13 years 9 months ago
1999
We describe a new way to construct large subdirectly irreducibles within an equational class of algebras. We use this construction to show that there are forbidden geometries of m...