90 search results - page 1 / 18 » On the Decidability of the Equivalence Problem for Monadic R... |
ITA
2000
13 years 5 months ago
2000
PODS
2004
ACM
14 years 5 months ago
2004
ACM
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
ICDT
1995
ACM
13 years 9 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
SLOGICA
2008
13 years 4 months ago
2008
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...