Sciweavers

1000 search results - page 48 / 200
» Nominal rewriting systems
Sort
View
CSR
2009
Springer
13 years 11 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
CADE
2003
Springer
14 years 8 months ago
Proof Search and Proof Check for Equational and Inductive Theorems
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
Eric Deplagne, Claude Kirchner, Hélè...
XIMEP
2005
ACM
121views Database» more  XIMEP 2005»
14 years 1 months ago
Trading Precision for Throughput in XPath Processing
We present in this paper a system for rewriting user-specific XPath queries for higher sharing of common sub-expressions in a streaming environment. We rewrite these queries acco...
Engie Bashir, Jihad Boulos
ENTCS
2008
128views more  ENTCS 2008»
13 years 7 months ago
Algebraic Stuttering Simulations
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
Narciso Martí-Oliet, José Meseguer, ...
EDBT
2002
ACM
136views Database» more  EDBT 2002»
14 years 7 months ago
Rewriting Unions of General Conjunctive Queries Using Views
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...
Junhu Wang, Michael J. Maher, Rodney W. Topor