Counting Models in Integer Domains

@inproceedings{Morgado2006CountingMI,
  title={Counting Models in Integer Domains},
  author={Ant{\'o}nio Morgado and Paulo J. Matos and Vasco M. Manquinho and Joao Marques-Silva},
  booktitle={SAT},
  year={2006}
}
This paper addresses the problem of counting models in integer linear programming (ILP) using Boolean Satisfiability (SAT) techniques, and proposes two approaches to solve this problem. The first approach consists of encoding ILP instances into pseudo-Boolean (PB) instances. Moreover, the paper introduces a model counter for PB constraints, which can be used for counting models in PB as well as in ILP. A second alternative approach consists of encoding instances of ILP into instances of SAT. A… CONTINUE READING

Figures, Tables, and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

A fast pseudo-Boolean constraint solver

  • Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
  • 2003
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL