Sciweavers

8413 search results - page 71 / 1683
» Ordering Problem Subgoals
Sort
View
AAAI
1994
13 years 9 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
IJAR
2006
118views more  IJAR 2006»
13 years 8 months ago
Learning Bayesian network parameters under order constraints
We consider the problem of learning the parameters of a Bayesian network from data, while taking into account prior knowledge about the signs of influences between variables. Such...
A. J. Feelders, Linda C. van der Gaag
KI
2008
Springer
13 years 8 months ago
Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
Martin Hofmann 0008, Emanuel Kitzelmann, Ute Schmi...
JAR
2002
72views more  JAR 2002»
13 years 7 months ago
Partial Instantiation Methods for Inference in First-Order Logic
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
EMNLP
2006
13 years 9 months ago
Sentence ordering with manifold-based classification in multi-document summarization
In this paper, we propose a sentence ordering algorithm using a semi-supervised sentence classification and historical ordering strategy. The classification is based on the manifo...
Paul D. Ji, Stephen G. Pulman