1650 search results - page 126 / 330 » The HOM problem is decidable |
143
Voted
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
105
click to vote
DASFAA
2007
IEEE
15 years 10 months ago
2007
IEEE
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
129
Voted
IDEAS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
144
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
155
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...