3719 search results - page 37 / 744 » order 2010 |
WRLA
2010
13 years 8 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
JAR
2010
13 years 4 months ago
2010
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
SIAMMAX
2010
13 years 4 months ago
2010
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...
SOCINFO
2010
13 years 4 months ago
2010
A huge amount of administrative effort is required for large wiki systems to produce and maintain high quality pages with existing naive access control policies. This paper introdu...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the...