6274 search results - page 142 / 1255 » Proofs, Programs, Processes |
180
click to vote
SIAMJO
2010
15 years 4 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
161
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
157
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
178
click to vote
EMO
2003
Springer
15 years 11 months ago
2003
Springer
This paper introduces an interface specification (PISA) that allows to separate the problem-specific part of an optimizer from the problem-independent part. We propose a view of ...
176
click to vote
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...