80 search results - page 11 / 16 » On the Complexity of Reasoning in Kleene Algebra |
JACM
2010
13 years 6 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
ISCI
2008
13 years 7 months ago
2008
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
ENTCS
2006
13 years 7 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
EDBT
2006
ACM
13 years 11 months ago
2006
ACM
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...