2845 search results - page 141 / 569 » Constraints over Ontologies |
100
click to vote
LREC
2010
15 years 8 months ago
2010
The paper explores the co-reference chains as a way for improving the density of concept annotation over domain texts. The idea extends authors' previous work on relating the...
277
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
148
click to vote
HM
2007
Springer
16 years 21 days ago
2007
Springer
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
172
click to vote
IAT
2006
IEEE
16 years 18 days ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
164
click to vote
ECAI
2004
Springer
15 years 12 months ago
2004
Springer
We present a framework for annotating dynamic scenes involving occlusion and other uncertainties. Our system comprises an object tracker, an object classifier and an algorithm for...