Sciweavers

6167 search results - page 999 / 1234
» Can Refinement be Automated
Sort
View
HUC
2004
Springer
14 years 4 months ago
Opportunity Knocks: A System to Provide Cognitive Assistance with Transportation Services
We present an automated transportation routing system, called “Opportunity Knocks,” whose goal is to improve the efficiency, safety and independence of individuals with mild co...
Donald J. Patterson, Lin Liao, Krzysztof Gajos, Mi...
ICLP
2004
Springer
14 years 4 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ICLP
2004
Springer
14 years 4 months ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
ILP
2004
Springer
14 years 4 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
ILP
2004
Springer
14 years 4 months ago
Improving Rule Evaluation Using Multitask Learning
Abstract. This paper introduces Deft, a new multitask learning approach for rule learning algorithms. Like other multitask learning systems, the one proposed here is able to improv...
Mark D. Reid