Sciweavers

5 search results - page 1 / 1
» Satisfiability of downward XPath with data equality tests
Sort
View
PODS
2009
ACM
122views Database» more  PODS 2009»
14 years 5 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
ICDT
2010
ACM
259views Database» more  ICDT 2010»
14 years 1 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 4 months ago
Two-variable logic on data trees and XML reasoning
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Th...
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
14 years 5 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 4 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...