186 search results - page 30 / 38 » Decidable Extensions of Church's Problem |
ECAI
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
One of the most challenging aspects of managing a very large data warehouse is identifying how queries will behave before they start executing. Yet knowing their performance charac...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...