Sciweavers

4218 search results - page 331 / 844
» Complete sets of cooperations
Sort
View
JAPLL
2006
114views more  JAPLL 2006»
15 years 7 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
172
Voted
JIIS
2006
124views more  JIIS 2006»
15 years 7 months ago
An efficient approach to mining indirect associations
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
225
Voted
FUIN
2007
90views more  FUIN 2007»
15 years 7 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
224
Voted
JAR
2007
142views more  JAR 2007»
15 years 7 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
186
Voted
TKDE
2008
128views more  TKDE 2008»
15 years 7 months ago
Mixed-Drove Spatiotemporal Co-Occurrence Pattern Mining
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
Mete Celik, Shashi Shekhar, James P. Rogers, James...