192 search results - page 2 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
107
click to vote
DAC
2001
ACM
16 years 2 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
117
click to vote
AISC
2008
Springer
15 years 3 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
121
click to vote
DAC
2004
ACM
16 years 2 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
106
click to vote
SAT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance...
124
click to vote
KR
2010
Springer
15 years 6 months ago
2010
Springer
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...