Sciweavers

146 search results - page 18 / 30
» Rewriting of Regular Expressions and Regular Path Queries
Sort
View
RTA
2005
Springer
15 years 3 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
ICPR
2002
IEEE
15 years 10 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha
ICDE
2008
IEEE
218views Database» more  ICDE 2008»
15 years 11 months ago
AxPRE Summaries: Exploring the (Semi-)Structure of XML Web Collections
The nature of semistructured data in web collections is evolving. Increasingly, XML web documents (or documents exchanged via web services) are valid with regard to a schema, yet ...
Mariano P. Consens, Flavio Rizzolo, Alejandro A. V...
PODS
2007
ACM
104views Database» more  PODS 2007»
15 years 9 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
MFCS
2009
Springer
15 years 4 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan