Abstract Cores in Implicit Hitting Set MaxSat Solving-Reference-Cited by-同舟云学术

Abstract Cores in Implicit Hitting Set MaxSat Solving

Published:2020 Issue: Volume: Page:277-294
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2020
language:
Short-container-title:

Author:

Berg Jeremias^ORCID,Bacchus Fahiem,Poole Alex

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-51825-7_20

Reference31 articles.

1. Andres, B., Kaufmann, B., Matheis, O., Schaub, T.: Unsatisfiability-based optimization in clasp. In: Dovier, A., Costa, V.S. (eds.) Technical Communications of ICLP. LIPIcs, vol. 17, pp. 211–221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012). https://doi.org/10.4230/LIPIcs.ICLP.2012.211

2. Ansótegui, C., Bonet, M.L., Levy, J.: SAT-based MaxSAT algorithms. Artif. Intell. 196, 77–105 (2013). https://doi.org/10.1016/j.artint.2013.01.002

3. Lecture Notes in Computer Science;R Asín,2009

4. Bacchus, F., Järvisalo, M., Martins, R.: MaxSAT evaluation 2018: new developments and detailed results. J. Satisf. Boolean Model. Comput. 11(1), 99–131 (2019). https://doi.org/10.3233/SAT190119

5. Bacchus, F., Järvisalo, M., Martins, R. (eds.): MaxSAT Evaluation 2019: Solver and Benchmark Descriptions. Department of Computer Science Report Series B, Department of Computer Science, University of Helsinki, Finland (2019)

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

1. Certified MaxSAT Preprocessing;Lecture Notes in Computer Science;2024

2. An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis;Lecture Notes in Computer Science;2024

3. Computing optimal hypertree decompositions with SAT;Artificial Intelligence;2023-12