Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints

Soukaina Hattad, Said Jabbour, Lakhdar Sais, Yakoub Salhi

Abstract

In this paper, we propose to deal with the encoding of cardinality constraints ∑ni=1 xi ≥ b into conjunctive normal form. We consider the one proposed recently (Jabbour et al., 2014) based on pigeon-hole problem. Then, we show that even if the number of clauses of the CNF based encoding is in O(b x (n - b)),, the number of literals of resulting formula can be much more higher O(b(n-b)²)$. To decrease the complexity in terms of number of literals, we propose a compact representation of some clauses of the encoding. Our approach allows to have a quadratic encoding in terms of literals while maintaining the same complexity in terms of clauses and additional variables. An experimental evaluation is performed to show the competitiveness of the new encoding.

References

  1. Aloul, F. A., Ramani, A., Markov, I. L., and Sakallah, K. A. (2003). Solving difficult instances of boolean satisfiability in the presence of symmetry. IEEE Trans. on CAD of Integrated Circuits and Systems, 22(9):1117- 1137.
  2. Aloul, F. A., Sakallah, K. A., and Markov, I. L. (2006). Efficient symmetry breaking for boolean satisfiability. IEEE Trans. Computers, 55(5):549-558.
  3. Asín, R., Nieuwenhuis, R., Oliveras, A., and Rodr íguezCarbonell, E. (2009). Cardinality networks and their applications. In 12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009), pages 167-180.
  4. Bailleux, O. and Boufkhad, Y. (2003). Efficient cnf encoding of boolean cardinality constraints. In 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), pages 108-122.
  5. Bailleux, O., Boufkhad, Y., and Roussel, O. (2009). New encodings of pseudo-boolean constraints into cnf. In SAT'2009, pages 181-194.
  6. Benhamou, B. and Sais, L. (1992). Theoretical study of symmetries in propositional calculus and applications. In 11th International Conference on Automated Deduction (CADE'1992), volume 607 of Lecture Notes in Computer Science, pages 281-294. Springer.
  7. Benhamou, B. and Sais, L. (1994). Tractability through symmetries in propositional calculus. Journal of Automated Reasoning, 12(1):89-102.
  8. Cook, S. A. (1976). A short proof of the pigeon hole principle using extended resolution. SIGACT News, 8(4):28-32.
  9. Crawford, J. (1992). A theorical analysis of reasoning by symmetry in first order logic. InProceedings of Workshop on Tractable Reasonning, AAAI, pages 17-22.
  10. Crawford, J. M., Ginsberg, M. L., Luks, E. M., and Roy, A. (1996). Symmetry-breaking predicates for search problems. In KR, pages 148-159.
  11. Eén, N. and Sörensson, N. (2006). Translating pseudoboolean constraints into sat. JSAT, 2(1-4):1-26.
  12. Gent, I. P., Petrie, K. E., and Puget, J.-F. (2006). Chapter 10 symmetry in constraint programming. In F. Rossi, P. v. B. and Walsh, T., editors, Handbook of Constraint Programming, volume 2 of Foundations of Artificial Intelligence, pages 329 - 376. Elsevier.
  13. Jabbour, S., Saïs, L., and Salhi, Y. (2014). A pigeon-hole based encoding of cardinality constraints. In International Symposium on Artificial Intelligence and Mathematics, ISAIM 2014, Fort Lauderdale, FL, USA, January 6-8, 2014.
  14. Jabbour, S., Sais, L., Salhi, Y., and Uno, T. (2013). Miningbased compression approach of propositional formulae. In CIKM, pages 289-298.
  15. Krishnamurthy, B. (1985). Shorts proofs for tricky formulas. Acta Informatica, 22:253-275.
  16. Kullmann, O. (1997). On a generalization of extended resolution. Discrete Applied Mathematics, 34:73-95.
  17. Plaisted, D. A. and Greenbaum, S. (1986). A structurepreserving clause form translation. Journal of Symbolic Computation, 2(3):293-304.
  18. Puget, J. (1993). On the satisfiability of symmetrical constraint satisfaction problems. In proceedings of ISMIS, pages 350-361.
  19. Silva, J. P. M. and Lynce, I. (2007). Towards robust cnf encodings of cardinality constraints. In 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), pages 483-497.
  20. Sinz, C. (2005). Towards an optimal cnf encoding of boolean cardinality constraints. In 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), pages 827-831.
  21. Tseitin, G. (1968). On the complexity of derivations in the propositional calculus. In Slesenko, H., editor, Structures in Constructives Mathematics and Mathematical Logic, Part II, pages 115-125.
  22. Walsh, T. (2006). General symmetry breaking constraints. In 12th International Conference on Principles and Practice of Constraint Programming (CP 2006), pages 650-664.
  23. Warners, J. P. (1996). A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters.
Download


Paper Citation


in Harvard Style

Hattad S., Jabbour S., Sais L. and Salhi Y. (2017). Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints . In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-220-2, pages 299-307. DOI: 10.5220/0006252502990307


in Bibtex Style

@conference{icaart17,
author={Soukaina Hattad and Said Jabbour and Lakhdar Sais and Yakoub Salhi},
title={Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2017},
pages={299-307},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006252502990307},
isbn={978-989-758-220-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints
SN - 978-989-758-220-2
AU - Hattad S.
AU - Jabbour S.
AU - Sais L.
AU - Salhi Y.
PY - 2017
SP - 299
EP - 307
DO - 10.5220/0006252502990307