$$\#\exists $$ SAT: Projected Model Counting-Reference-Cited by-同舟云学术

$$\#\exists $$ SAT: Projected Model Counting

Published:2015 Issue: Volume: Page:121-137
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Aziz Rehan Abdul,Chu Geoffrey,Muise Christian,Stuckey Peter

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-24318-4_10

Reference19 articles.

1. Bacchus, F., Dalmao, S., Pitassi, T.: DPLL with Caching: A new algorithm for #SAT and Bayesian Inference. Electronic Colloquium on Computational Complexity (ECCC) 10(003) (2003)

2. Bacchus, F., Dalmao, S., Pitassi, T.: Solving #SAT and Bayesian Inference with Backtracking Search. Journal of Artificial Intelligence Research (JAIR) 34, 391–442 (2009)

3. Lecture Notes in Computer Science;J Brauer,2011

4. Darwiche, A.: Decomposable negation normal form. J. ACM 48(4), 608–647 (2001)

5. Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research (JAIR) 17, 229–264 (2002)

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

1. Inference of Robust Reachability Constraints;Proceedings of the ACM on Programming Languages;2024-01-05

2. Function Synthesis for Maximizing Model Counting;Lecture Notes in Computer Science;2023-12-30

3. On the benefits of knowledge compilation for feature-model analyses;Annals of Mathematics and Artificial Intelligence;2023-11-06

4. A Scalable Shannon Entropy Estimator;Computer Aided Verification;2022

5. OuterCount: A First-Level Solution-Counter for Quantified Boolean Formulas;Lecture Notes in Computer Science;2022