CORR
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory a...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
CORR
2002
Springer
13 years 11 months ago
2002
Springer
CORR
2002
Springer
13 years 11 months ago
2002
Springer
We describe our experiences in using Spin to verify parts of the Multi Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of processes connect...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
CORR
2002
Springer
13 years 11 months ago
2002
Springer
This paper addresses the problem of classifying observations when features are context-sensitive, especially when the testing set involves a context that is different from the tra...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
We have analyzed manufacturing data from several different semiconductor manufacturing plants, using decision tree induction software called Q-YIELD. The software generates rules ...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
A large body of research in machine learning is concerned with supervised learning from examples. The examples are typically represented as vectors in a multi-dimensional feature ...