63 search results - page 5 / 13 » A Comparative Study of Logic Programs with Preference |
CHI
2010
ACM
14 years 2 months ago
2010
ACM
Developers, like all modern knowledge workers, are frequently interrupted and blocked in their tasks. In this paper we present a contextual inquiry into developers’ current stra...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
ICALP
2009
Springer
14 years 2 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
AAAI
2007
13 years 9 months ago
2007
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...