Sciweavers

143 search results - page 3 / 29
» Semantic Grep: Regular Expressions Relational Abstraction
Sort
View
84
Voted
LATA
2010
Springer
15 years 2 months ago
Simplifying Regular Expressions. A Quantitative Perspective
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
Hermann Gruber and Stefan Gulan
68
Voted
DBPL
2007
Springer
83views Database» more  DBPL 2007»
15 years 3 months ago
Succinctness of Pattern-Based Schema Languages for XML
Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules...
Wouter Gelade, Frank Neven
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
14 years 10 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 2 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
LICS
2009
IEEE
15 years 4 months ago
Trace Semantics is Fully Abstract
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
Sumit Nain, Moshe Y. Vardi