24 search results - page 2 / 5 » On Closure Operator for Interval Order Structures |
STACS
1994
Springer
13 years 9 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
TIME
1994
IEEE
13 years 9 months ago
1994
IEEE
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...