Sciweavers

500 search results - page 50 / 100
» ACD Term Rewriting
Sort
View
IANDC
2007
106views more  IANDC 2007»
14 years 11 months ago
Tyrolean termination tool: Techniques and features
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
Nao Hirokawa, Aart Middeldorp
CORR
2004
Springer
107views Education» more  CORR 2004»
14 years 11 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune
SEMWEB
2010
Springer
14 years 9 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 8 days ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
WIDM
2003
ACM
15 years 5 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear