432 search results - page 12 / 87 » On Notions of Regularity for Data Languages |
FOIKS
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
ISMVL
2000
IEEE
13 years 12 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
ECOOP
2009
Springer
14 years 8 months ago
2009
Springer
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
POPL
1993
ACM
13 years 11 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...