Exploiting subproblem optimization in SAT-based MaxSAT algorithms-Reference-Cited by-同舟云学术

Exploiting subproblem optimization in SAT-based MaxSAT algorithms

Published:2015-09-15 Issue:1 Volume:22 Page:1-53
ISSN:1381-1231
Container-title:Journal of Heuristics
language:en
Short-container-title:J Heuristics

Author:

Ansótegui Carlos,Gabàs Joel,Levy Jordi

Funder

Ministerio de Economía y Competitividad (ES)

Google (US)

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/s10732-015-9300-7.pdf

Reference58 articles.

1. Andres, B., Kaufmann, B., Matheis, O., Schaub, T.: Unsatisfiability-based optimization in clasp. In: ICLP (Technical Communications), pp. 211–221 (2012)

2. Ansotegui, C.: Maxsat Latest Developments. Invited Tutorial at CP 2013 (2013a)

3. Ansotegui, C.: Tutorial: Maxsat Latest Developments (2013b)

4. Ansótegui, C., Gabàs, J.: Solving (weighted) partial maxsat with ilp. In: CPAIOR, pp. 403–409 (2013)

5. Ansótegui, C., Bonet, M.L., Levy, J.: On solving MaxSAT through SAT. In: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence (CCIA’09), pp. 284–292 (2009)

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

1. Incomplete MaxSAT approaches for combinatorial testing;Journal of Heuristics;2022-08

2. A Stochastic Local Search Algorithm for the Partial Max-SAT Problem Based on Adaptive Tuning and Variable Depth Neighborhood Search;IEEE Access;2021

3. Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search;Lecture Notes in Computer Science;2020

4. A resolution calculus for MinSAT;Logic Journal of the IGPL;2019-10-23

5. Clause tableaux for maximum and minimum satisfiability;Logic Journal of the IGPL;2019-08-27