7868 search results - page 147 / 1574 » Learning by Answer Sets |
144
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
128
click to vote
CSR
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
147
click to vote
SOCIALCOM
2010
15 years 2 months ago
2010
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
149
click to vote
IFIP12
2010
15 years 3 months ago
2010
: An investigation of rule learning processes that allow the inclusion of negated features is described. The objective is to establish whether the use of negation in inductive rule...
NIPS
2004
15 years 6 months ago
2004
Choice-based conjoint analysis builds models of consumer preferences over products with answers gathered in questionnaires. Our main goal is to bring tools from the machine learni...