1144 search results - page 150 / 229 » Logic programming for combinatorial problems |
118
Voted
PKDD
2000
Springer
15 years 6 months ago
2000
Springer
Although there is a growing need for multi-relational data mining solutions in KDD, the use of obvious candidates from the field of Inductive Logic Programming (ILP) has been limit...
143
Voted
TABLEAUX
1995
Springer
15 years 6 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
102
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
154
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
237
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...