1466 search results - page 14 / 294 » Complexity of Reasoning over Temporal Data Models |
124
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
181
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
107
Voted
KDD
1998
ACM
15 years 7 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
101
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
135
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological beha...