663 search results - page 2 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
101
Voted
IRI
2006
IEEE
15 years 7 months ago
2006
IEEE
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
107
click to vote
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
123
click to vote
AI
2000
Springer
15 years 1 months ago
2000
Springer
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
104
Voted
CADE
2009
Springer
16 years 2 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
145
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...