1650 search results - page 77 / 330 » The HOM problem is decidable |
138
click to vote
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
124
click to vote
DLOG
2007
15 years 6 months ago
2007
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
142
click to vote
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
152
click to vote
IJCAI
2003
15 years 5 months ago
2003
In this paper we address the problem of query answering and rewriting in global-as-view data integration systems, when key and inclusion dependencies are expressed on the global i...
138
click to vote
ACTA
2007
15 years 4 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...