6020 search results - page 11 / 1204 » A New Approach to Model Counting |
NIPS
2008
15 years 1 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
109
click to vote
LPAR
2010
Springer
14 years 9 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
SMC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— We consider the problem of efficiently storing ngram counts for large n over very large corpora. In such cases, the efficient storage of sufficient statistics can ha...
AAAI
2008
15 years 2 months ago
2008
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
DBPL
2007
Springer
15 years 3 months ago
2007
Springer
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...