330 search results - page 27 / 66 » Algorithms for Propositional Model Counting |
SAT
2005
Springer
15 years 3 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
JLP
2000
14 years 9 months ago
2000
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
75
Voted
CIMAGING
2010
14 years 11 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
135
click to vote
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
107
click to vote
NMR
2004
Springer
15 years 2 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...