1650 search results - page 258 / 330 » The HOM problem is decidable |
100
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
212
click to vote
CDB
1997
Springer
15 years 8 months ago
1997
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
131
click to vote
ICLP
1997
Springer
15 years 8 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
118
click to vote
TAPSOFT
1997
Springer
15 years 8 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
180
click to vote
CAV
1994
Springer
15 years 8 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...