1650 search results - page 124 / 330 » The HOM problem is decidable |
146
Voted
IJIS
2011
14 years 7 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
139
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
153
click to vote
MATES
2009
Springer
15 years 10 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
139
click to vote
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
137
click to vote
JCS
2008
15 years 4 months ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...