1242 search results - page 116 / 249 » The Theory of Grammar Constraints |
154
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
180
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Possible-world semantics are provided for Parikh’s relevance-sensitive model for belief revision. Having Grove’s system-of-spheres construction as a base, we consider addition...
169
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
163
click to vote
AAAI
1996
15 years 7 months ago
1996
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...