Author:
Argelich Josep,Manyà Felip
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Lecture Notes in Computer Science;T. Alsinet,2005
2. Lecture Notes in Computer Science;J. Argelich,2005
3. Argelich, J., Manyà, F.: Exact Max-SAT solvers for over-constrained problems. Journal of Heuristics 12(4–5), 375–392 (2006)
4. Argelich, J., Manyà, F.: Learning hard constraints in Max-SAT. In: Proceedings of the Workshop on Constraint Solving and Constraint Logic Porgramming, CSCLP-2006, Lisbon, Portugal, pp. 1–12 (2006)
5. Lecture Notes in Computer Science;N. Bansal,1999
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data;Proceedings of the IEEE/ACM 46th International Conference on Software Engineering;2024-02-06
2. Revisiting Maximum Satisfiability and Related Problems in Data Streams;Lecture Notes in Computer Science;2022
3. Parallel Maximum Satisfiability;Handbook of Parallel Constraint Reasoning;2018
4. A Taxonomy of Exact Methods for Partial Max-SAT;Journal of Computer Science and Technology;2013-03
5. Handling software upgradeability problems with MILP solvers;Electronic Proceedings in Theoretical Computer Science;2010-07-06