Sciweavers

113 search results - page 17 / 23
» Complete involutive rewriting systems
Sort
View
ACS
2008
13 years 7 months ago
Subobject Transformation Systems
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
Andrea Corradini, Frank Hermann, Pawel Sobocinski
CADE
2009
Springer
14 years 8 months ago
Beyond Dependency Graphs
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
Martin Korp, Aart Middeldorp
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
14 years 7 months ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
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...
Ian Wehrman, Aaron Stump
VLDB
2011
ACM
245views Database» more  VLDB 2011»
13 years 2 months ago
Normalization and optimization of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. They are an important tool in several areas of database research, notab...
Georg Gottlob, Reinhard Pichler, Vadim Savenkov