804 search results - page 31 / 161 » On the Termination of the Chase Algorithm |
62
Voted
TPHOL
2003
IEEE
15 years 3 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
94
Voted
IJNSEC
2007
14 years 10 months ago
2007
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
AAECC
2008
Springer
14 years 10 months ago
2008
Springer
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...