Cores in Core Based MaxSat Algorithms: An Analysis-Reference-Cited by-同舟云学术

Cores in Core Based MaxSat Algorithms: An Analysis

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

Author:

Bacchus Fahiem,Narodytska Nina

Publisher

Springer International Publishing

Link

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

Reference15 articles.

1. Lecture Notes in Computer Science;C. Ansótegui,2012

2. Lecture Notes in Computer Science;C. Ansótegui,2009

3. Ansótegui, C., Bonet, M.L., Levy, J.: A new algorithm for weighted partial MaxSAT. In: Proceedings of the AAAI National Conference, AAAI (2010)

4. Ansótegui, C., Bonet, M.L., Levy, J.: SAT-based MaxSAT algorithms. Artificial Intelligence 196, 77–105 (2013)

5. Ansótegui, C., Gabàs, J.: Solving (weighted) partial MaxSAT with ILP. In: International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pp. 403–409 (2013)

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

1. Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search;Fundamenta Informaticae;2020-12-18

2. Core-Guided and Core-Boosted Search for CP;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2020

3. From Checking to Inference: Actual Causality Computations as Optimization Problems;Automated Technology for Verification and Analysis;2020

4. Core-Boosted Linear Search for Incomplete MaxSAT;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2019

5. Model enumeration in propositional circumscription via unsatisfiable core analysis;Theory and Practice of Logic Programming;2017-08-22