Sciweavers

124 search results - page 4 / 25
» The Undecidability of the Generalized Collatz Problem
Sort
View
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 7 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
PODS
2003
ACM
142views Database» more  PODS 2003»
14 years 7 months ago
Query containment and rewriting using views for regular path queries under constraints
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
Gösta Grahne, Alex Thomo
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 5 months ago
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
Franco Montagna, Carles Noguera
ICALP
2007
Springer
14 years 1 months ago
Boundedness of Monadic FO over Acyclic Structures
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very res...
Stephan Kreutzer, Martin Otto, Nicole Schweikardt
FSTTCS
2006
Springer
13 years 11 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...