On computing minimal independent support and its applications to sampling and counting-Reference-Cited by-同舟云学术

On computing minimal independent support and its applications to sampling and counting

Published:2015-08-15 Issue:1 Volume:21 Page:41-58
ISSN:1383-7133
Container-title:Constraints
language:en
Short-container-title:Constraints

Author:

Ivrii Alexander,Malik Sharad,Meel Kuldeep S.,Vardi Moshe Y.

Funder

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10601-015-9204-z.pdf

Reference33 articles.

1. Ignatiev, A., Previti, A., Liffiton, M., & Marques-Silva, J. (2015). Smallest mus extraction with minimal hitting set dualization. In Proceedings of CP (To Appear).

2. Bacchus, F., Dalmao, S., & Pitassi, T. (2003). Algorithms and complexity results for #SAT and Bayesian inference. In Proceedings of FOCS (pp. 340–351).

3. Belov, A., & Marques-Silva, J. (2012). Generalizing redundancy in propositional logic: Foundations and hitting sets duality. CoRR abs/1207.1257.

4. Belov, A., & Marques-Silva, J. (2012). Muser2: an efficient MUS extractor. JSAT, 8(3/4), 123–128.

5. Carter, J. L., & Wegman, M. N. (1977). Universal classes of hash functions. In Proceedings of ACM symposium on Theory of computing (pp. 106–112). ACM.

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

1. Preprocessing is What You Need: Understanding and Predicting the Complexity of SAT-based Uniform Random Sampling;Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE);2024-04-14

2. Diversity-aware fairness testing of machine learning classifiers through hashing-based sampling;Information and Software Technology;2024-03

3. Model Counting Meets Distinct Elements;Communications of the ACM;2023-08-23

4. Model Counting Meets F ₀ Estimation;ACM Transactions on Database Systems;2023-08-09

5. Hashing-based approximate counting of minimal unsatisfiable subsets;Formal Methods in System Design;2023-04-19