Author:
Dahllöf Vilhelm,Jonsson Peter,Wahlström Magnus
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. R. J. Bayardo, Jr. and J. Pehoushek. Counting models using connected components. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), pages 157–162. AAAI Press, 2000.
2. E. Birnbaum and E. L. Lozinskii. The good old Davis-Putnam procedure helps counting models. Journal of Artificial Intelligence Research, 10:457–477, 1999.
3. V. Dahllöf and P. Jonsson. An algorithm for counting maximum weighted independent sets and its applications. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2002), pages 292–298, 2002.
4. O. Dubois. Counting the number of solutions for instances of satisfiability. Theoretical Computer Science, 81(1):49–64, 1991.
5. L. Goldberg and M. Jerrum. Counting unlabelled subtrees of a tree is #P-complete. LMS Journal of Computation and Mathematics, 3:117–124, 2000.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Picturing Counting Reductions with the ZH-Calculus;Electronic Proceedings in Theoretical Computer Science;2023-08-30
2. The Worst Case Minimized Upper Bound in #2-SAT;Lecture Notes in Electrical Engineering;2012-11-06
3. New upper bound for the #3-SAT problem;Information Processing Letters;2007-12
4. Counting models for 2SAT and 3SAT formulae;Theoretical Computer Science;2005-02
5. On Computing k-CNF Formula Properties;Theory and Applications of Satisfiability Testing;2004