1667 search results - page 17 / 334 » Extended clause learning |
127
click to vote
ILP
2000
Springer
15 years 7 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
119
click to vote
AAAI
2008
15 years 6 months ago
2008
We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying th...
134
click to vote
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
131
click to vote
COMPSAC
1996
IEEE
15 years 8 months ago
1996
IEEE
We present the architecture and design details of a logic database system that extends functionality in a number of ways. The system supports indefinite (non-Horn) facts in extens...
179
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...