Sciweavers

1252 search results - page 6 / 251
» Minimizing Learned Clauses
Sort
View
75
Voted
ILP
1998
Springer
15 years 1 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia
PROPOR
2010
Springer
173views Languages» more  PROPOR 2010»
14 years 7 months ago
A Machine Learning Approach to Portuguese Clause Identification
Abstract. In this work, we apply and evaluate a machine-learningbased system to Portuguese clause identification. To the best of our knowledge, this is the first machine-learning-b...
Eraldo R. Fernandes, Cícero Nogueira dos Sa...
AI
2010
Springer
14 years 9 months ago
Extended clause learning
The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoreti...
Jinbo Huang
ILP
2004
Springer
15 years 3 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
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 9 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen