Simplifying Pseudo-Boolean Constraints in Residual Number Systems-Reference-Cited by-同舟云学术

Simplifying Pseudo-Boolean Constraints in Residual Number Systems

Published:2014 Issue: Volume: Page:351-366
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fekete Yoav,Codish Michael

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-09284-3_26

Reference18 articles.

1. Aavani, A., Mitchell, D.G., Ternovska, E.: New encoding for translating pseudo-Boolean constraints into SAT. In: Frisch, A.M., Gregory, P. (eds.) SARA. AAAI (2013)

2. 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)

3. Lecture Notes in Computer Science;C. Ansótegui,2005

4. Lecture Notes in Computer Science;O. Bailleux,2003

5. Barth, P.: Logic-based 0-1 constraint programming. Kluwer Academic Publishers, Norwell (1996)

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

1. Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases;Theory and Applications of Satisfiability Testing – SAT 2020;2020

2. N-level Modulo-Based CNF encodings of Pseudo-Boolean constraints for MaxSAT;Constraints;2019-01-12

3. Mixed Radix Weight Totalizer Encoding for Pseudo-Boolean Constraints;2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI);2017-11

4. SAT and IP based algorithms for magic labeling including a complete search for total magic labelings;Journal of Discrete Algorithms;2015-03