Corpus ID: 9943040

Counting CSP Solutions Using Generalized XOR Constraints

@inproceedings{Gomes2007CountingCS,
  title={Counting CSP Solutions Using Generalized XOR Constraints},
  author={C. Gomes and W. V. Hoeve and Ashish Sabharwal and B. Selman},
  booktitle={AAAI},
  year={2007}
}
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary variables for the CSP, and applies an XOR or parity constraint based method introduced previously for Boolean satisfiability (SAT) problems. In the CSP framework, in addition to the naive individual filtering of XOR constraints used in SAT, we are able to apply a global domain filtering algorithm by viewing these… Expand
43 Citations
Solution counting for CSP and SAT with large tree-width
  • 1
  • Highly Influenced
  • PDF
Exploiting Problem Structure for Solution Counting
  • 15
  • PDF
Improving Exact Solution Counting for Decomposition Methods
  • 3
  • PDF
Approximate Counting CSP Solutions Using Partition Function
  • PDF
On uniform sampling of cliques
  • 1
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 13 REFERENCES
Counting Models in Integer Domains
  • 15
  • Highly Influential
  • PDF
A Translation of Pseudo Boolean Constraints to SAT
  • 83
Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems
  • 37
  • Highly Influential
Counting Models Using Connected Components
  • 188
  • PDF
Combining Component Caching and Clause Learning for Effective Model Counting
  • 216
  • PDF
Effective lattice point counting in rational convex polytopes
  • 264
  • PDF
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
  • 43
  • PDF
A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints
  • M. Trick
  • Mathematics, Computer Science
  • Ann. Oper. Res.
  • 2003
  • 121
  • PDF
Streamlined Constraint Reasoning
  • 55
  • PDF
...
1
2
...