1650 search results - page 80 / 330 » The HOM problem is decidable |
PODS
2009
ACM
14 years 10 months ago
2009
ACM
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
ICDT
2010
ACM
14 years 7 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
CSE
2009
IEEE
14 years 4 months ago
2009
IEEE
—Constraints are an important part of role-based access control policies. The safety or security of a system is maintained by enforcing constraints that are specified in the pol...
FCT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...