Improving MCS Enumeration via Caching-Reference-Cited by-同舟云学术

Improving MCS Enumeration via Caching

Published:2017 Issue: Volume: Page:184-194
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2017
language:
Short-container-title:

Author:

Previti Alessandro,Mencía Carlos,Järvisalo Matti,Marques-Silva Joao

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-66263-3_12

Reference31 articles.

1. Lecture Notes in Computer Science;MF Arif,2015

2. Bacchus, F., Dalmao, S., Pitassi, T.: Solving #SAT and Bayesian inference with backtracking search. J. Artif. Intell. Res. 34, 391–442 (2009)

3. Bacchus, F., Davies, J., Tsimpoukelli, M., Katsirelos, G.: Relaxation search: a simple way of managing optional clauses. In: Proceedings of AAAI, pp. 835–841. AAAI Press (2014)

4. Lecture Notes in Computer Science;J Bailey,2005

5. Beame, P., Impagliazzo, R., Pitassi, T., Segerlind, N.: Formula caching in DPLL. Trans. Comput. Theor. 1(3), 9:1–9:33 (2010)

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

1. Exact and approximate determination of the Pareto front using Minimal Correction Subsets;Computers & Operations Research;2023-05

2. Computing MUS-Based Inconsistency Measures;Logics in Artificial Intelligence;2023

3. Logic-Based Explainability in Machine Learning;Reasoning Web. Causality, Explanations and Declarative Knowledge;2023

4. A Simple yet Efficient MCSes Enumeration with SAT Oracles;Intelligent Information and Database Systems;2020

5. Computing Shortest Resolution Proofs;Progress in Artificial Intelligence;2019