Approximately Propagation Complete and Conflict Propagating Constraint Encodings-Reference-Cited by-同舟云学术

Approximately Propagation Complete and Conflict Propagating Constraint Encodings

Published:2018 Issue: Volume: Page:19-36
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2018
language:
Short-container-title:

Author:

Ehlers Rüdiger,Palau Romero Francisco

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-94144-8_2

Reference26 articles.

1. Lecture Notes in Computer Science;I Abío,2013

2. Alviano, M., Dodaro, C., Ricca, F.: A MaxSAT algorithm using cardinality constraints of bounded size. In: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25–31 July 2015, pp. 2677–2683 (2015). http://ijcai.org/Abstract/15/379

3. Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: Cardinality networks: a theoretical and empirical study. Constraints 16(2), 195–221 (2011). https://doi.org/10.1007/s10601-010-9105-0

4. Babka, M., Balyo, T., Cepek, O., Gurský, S., Kucera, P., Vlcek, V.: Complexity issues related to propagation completeness. Artif. Intell. 203, 19–34 (2013). https://doi.org/10.1016/j.artint.2013.07.006

5. Lecture Notes in Computer Science;F Bacchus,2004

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning a Propagation Complete Formula;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022

2. Chapter 24. Maximum Satisfiabiliy;Frontiers in Artificial Intelligence and Applications;2021-02-02