Encoding Linear Constraints with Implication Chains to CNF-Reference-Cited by-同舟云学术

Encoding Linear Constraints with Implication Chains to CNF

Published:2015 Issue: Volume: Page:3-11
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abío Ignasi,Mayer-Eichberger Valentin,Stuckey Peter J.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-23219-5_1

Reference17 articles.

1. Abio, I., Mayer-Eichberge, V., Stuckey, P.: Encoding linear constraints with implication chains to CNF. Tech. rep., University of Melbourne (2015). http://www.people.eng.unimelb.edu.au/pstuckey/papers/cp2015a.pdf

2. Abío, I.: Solving hard industrial combinatorial problems with SAT. Ph.D. thesis, Technical University of Catalonia (UPC) (2013)

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

4. Abío, I., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E., Mayer-Eichberger, V.: A New Look at BDDs for Pseudo-Boolean Constraints. J. Artif. Intell. Res. (JAIR) 45, 443–480 (2012)

5. Lecture Notes in Computer Science;I Abío,2014

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

1. Learning to select SAT encodings for pseudo-Boolean and linear integer constraints;Constraints;2023-09

2. SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints;Artificial Intelligence;2022-01

3. Solving complex problems using model transformations: from set constraint modeling to SAT instance solving;Expert Systems with Applications;2020-07

4. An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations;Artificial Intelligence Review;2020-02-18

5. Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints;Lecture Notes in Computer Science;2019