Solving MaxSAT with Bit-Vector Optimization-Reference-Cited by-同舟云学术

Solving MaxSAT with Bit-Vector Optimization

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

Author:

Nadel Alexander

Publisher

Springer International Publishing

Link

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

Reference47 articles.

1. Ansotegui, C., Bacchus, F., Järvisalo, M., Martins, R. (eds.): MaxSAT Evaluation 2017: Solver and Benchmark Descriptions, vol. B-2017-2. Department of Computer Science Series of Publications B. University of Helsinki (2017)

2. Argelich, J., Li, C.M., Manyà, F., Planes, J.: The first and second max-sat evaluations. JSAT 4(2–4), 251–278 (2008)

3. Bailleux, O.: On the CNF encoding of cardinality constraints and beyond. CoRR, abs/1012.3853 (2010)

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

5. Belov, A., Heule, M., Marques-Silva, J.: MUS extraction using clausal proofs. In: Sinz and Egly [45], pp. 48–57 (2014)

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

1. TT-Open-WBO-Inc: An Efficient Anytime MaxSAT Solver;Journal on Satisfiability, Boolean Modeling and Computation;2024-09-06

2. Study of Fine-grained Nested Parallelism in CDCL SAT Solvers;ACM Transactions on Parallel Computing;2021-09-30

3. Learning from survey propagation: a neural network for MAX-E-3-SAT;Machine Learning: Science and Technology;2021-07-14

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

5. New phase transitions for formulas in Łukasiewicz logic;Frontiers of Computer Science;2020-05-06