3238 search results - page 124 / 648 » On the Computational Interpretation of Negation |
175
click to vote
PADL
2000
Springer
15 years 10 months ago
2000
Springer
Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as...
187
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We study the problem of generating plausible interpretations
of a scene from a collection of line segments automatically
extracted from a single indoor image. We show that
we ca...
157
click to vote
DIS
2008
Springer
15 years 8 months ago
2008
Springer
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...
144
click to vote
CIE
2010
Springer
15 years 8 months ago
2010
Springer
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the refutation system of Resolution and its generalisations with bounded conjunction, ...
161
click to vote
CAV
2010
Springer
15 years 6 months ago
2010
Springer
We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, ocinear template or polyhedron domain...