143 search results - page 14 / 29 » Query Order and the Polynomial Hierarchy |
HICSS
1996
IEEE
15 years 1 months ago
1996
IEEE
In this paper, we present a document model which integrates the logical structure and hypertext link structure of hyperdocuments in order to manage structured documents with hyper...
PPSN
2004
Springer
15 years 2 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
89
Voted
FTP
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
116
click to vote
PODS
1999
ACM
15 years 1 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...