Two approximate algorithms for model counting
Model counting is the problem of computing the number of models or satisfying assignments for a given propositional formula, and is #P-complete. Owing to its inherent complexity, approximate model counting is an alternative in practice. Model counting using the extension rule is an exact method, and...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 657; s. 28 - 37 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
02.01.2017
|
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Model counting is the problem of computing the number of models or satisfying assignments for a given propositional formula, and is #P-complete. Owing to its inherent complexity, approximate model counting is an alternative in practice. Model counting using the extension rule is an exact method, and is considered as an alternative to resolution-based methods for model counting. Based on the exact method, we propose two approximate model counting algorithms, and prove the time complexity of the algorithms. Experimental results show that they have good performance in the accuracy and efficiency. |
|---|---|
| AbstractList | Model counting is the problem of computing the number of models or satisfying assignments for a given propositional formula, and is #P-complete. Owing to its inherent complexity, approximate model counting is an alternative in practice. Model counting using the extension rule is an exact method, and is considered as an alternative to resolution-based methods for model counting. Based on the exact method, we propose two approximate model counting algorithms, and prove the time complexity of the algorithms. Experimental results show that they have good performance in the accuracy and efficiency. |
| Author | Wang, Jinyan Yin, Minghao Wu, Jingli |
| Author_xml | – sequence: 1 givenname: Jinyan surname: Wang fullname: Wang, Jinyan email: wangjy612@gxnu.edu.cn organization: Guangxi Key Lab of Multi-source Information Mining & Security, Guangxi Normal University, Guilin, China – sequence: 2 givenname: Minghao surname: Yin fullname: Yin, Minghao organization: School of Computer Science and Information Technology, Northeast Normal University, Changchun, China – sequence: 3 givenname: Jingli surname: Wu fullname: Wu, Jingli organization: Guangxi Key Lab of Multi-source Information Mining & Security, Guangxi Normal University, Guilin, China |
| BookMark | eNp9j01rwzAMhs3oYG23H7Bb_kAyyU3ihJ1G2RcUdunOxrXlziWNi-19_ft5dKcdKl6QdHiEnhmbjH4kxq4RKgRsb3ZV0rHieaygzhFnbIqd6EvO-3rCprCAulz0orlgsxh3kKsR7ZSV609fqMMh-C-3V4kKNWx9cOltHwvrQ7H3hoZC-_cxuXF7yc6tGiJd_fU5e324Xy-fytXL4_PyblVq3otU1tbyVoGBXnVEmw0A1qpvFXaooWmJd52wFtpGKL7R2uTNgNKkOKJAg4s5w-NdHXyMgaw8hPxe-JYI8tdX7mT2lb--EuockRnxj9EuqeT8mIJyw0ny9khSVvpwFGTUjkZNxgXSSRrvTtA_ilJygA |
| CitedBy_id | crossref_primary_10_1080_0952813X_2022_2122588 |
| Cites_doi | 10.1007/BF02128670 10.1016/j.knosys.2012.06.011 10.1023/A:1027339205632 10.3233/AIC-140603 10.1613/jair.2648 10.1613/jair.2289 10.1007/s10479-009-0680-7 10.1007/BF01271266 10.1137/0218026 10.1613/jair.3232 10.1145/368273.368557 10.1016/0304-3975(86)90174-X 10.3724/SP.J.1001.2009.03320 10.1016/j.artint.2012.08.001 10.1613/jair.601 |
| ContentType | Journal Article |
| Copyright | 2016 Elsevier B.V. |
| Copyright_xml | – notice: 2016 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2016.04.047 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 37 |
| ExternalDocumentID | 10_1016_j_tcs_2016_04_047 S0304397516302316 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c297t-4ff26a0d09a8eebb0014a96a181c056e2887ff0657a2bccd87fd0acea21171d13 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000390971400005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 07:19:04 EST 2025 Tue Nov 18 22:32:42 EST 2025 Fri Feb 23 02:30:25 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Extension rule Propositional satisfiability Model counting Resolution principle |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-4ff26a0d09a8eebb0014a96a181c056e2887ff0657a2bccd87fd0acea21171d13 |
| PageCount | 10 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2016_04_047 crossref_citationtrail_10_1016_j_tcs_2016_04_047 elsevier_sciencedirect_doi_10_1016_j_tcs_2016_04_047 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-01-02 |
| PublicationDateYYYYMMDD | 2017-01-02 |
| PublicationDate_xml | – month: 01 year: 2017 text: 2017-01-02 day: 02 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2017 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Linial, Nisan (br0290) 1990; 10 Gomes, Hoffmann, Sabharwal, Selman (br0210) 2007 Selman, Kautz, Cohen (br0310) 1993 Wei, Selman (br0180) 2005 Wei, Erenrich, Selman (br0190) 2004 Bacchus, Dalmao, Pitassi (br0160) 2009; 34 Cai, Yin (br0030) 2012; 36 Yin, Sun (br0260) 2007 Gomes, Kautz, Sabharwal, Selman (br0010) 2008; vol. 3 Iwama (br0250) 1989; 18 Satish Kumar (br0100) 2002 Davis, Logemann, Loveland (br0120) 1962; 5 Bacchus, Dalmao, Pitassi (br0070) 2003 Li, Poupart, Beek (br0080) 2011; 40 Sang, Bacchus, Beame, Kautz, Pitassi (br0140) 2004 Jweeum, Valiant, Vazirani (br0200) 1986; 43 Bennett, Sankaranarayanan (br0280) 2011; vol. 6695 Yin, Lin, Sun (br0270) 2009; 20 Kroc, Sabharwal, Selman (br0060) 2011; 184 Gogate, Dechter (br0220) 2007 Thurley (br0150) 2006 Lagniez, Marquis (br0170) 2014 Lin, Sun, Zhang (br0240) 2003; 31 Gomes, Sabharwal, Selman (br0050) 2009; vol. 185 Kahn, Linial, Samorodnitsky (br0300) 1996; 16 Domshlak, Hoffmann (br0090) 2007; 30 Kroc, Sabharwal, Selman (br0230) 2011; 184 Nakhost, Müller (br0040) 2014; 27 Bayardo, Pehoushek (br0130) 2000 Rintanen (br0020) 2012; 193 Birnbaum, Lozinskii (br0110) 1999; 10 Thurley (10.1016/j.tcs.2016.04.047_br0150) 2006 Selman (10.1016/j.tcs.2016.04.047_br0310) 1993 Satish Kumar (10.1016/j.tcs.2016.04.047_br0100) 2002 Nakhost (10.1016/j.tcs.2016.04.047_br0040) 2014; 27 Linial (10.1016/j.tcs.2016.04.047_br0290) 1990; 10 Yin (10.1016/j.tcs.2016.04.047_br0260) 2007 Bayardo (10.1016/j.tcs.2016.04.047_br0130) 2000 Gomes (10.1016/j.tcs.2016.04.047_br0210) 2007 Gogate (10.1016/j.tcs.2016.04.047_br0220) 2007 Gomes (10.1016/j.tcs.2016.04.047_br0050) 2009; vol. 185 Bennett (10.1016/j.tcs.2016.04.047_br0280) 2011; vol. 6695 Rintanen (10.1016/j.tcs.2016.04.047_br0020) 2012; 193 Lagniez (10.1016/j.tcs.2016.04.047_br0170) 2014 Jweeum (10.1016/j.tcs.2016.04.047_br0200) 1986; 43 Cai (10.1016/j.tcs.2016.04.047_br0030) 2012; 36 Kahn (10.1016/j.tcs.2016.04.047_br0300) 1996; 16 Kroc (10.1016/j.tcs.2016.04.047_br0060) 2011; 184 Gomes (10.1016/j.tcs.2016.04.047_br0010) 2008; vol. 3 Sang (10.1016/j.tcs.2016.04.047_br0140) 2004 Bacchus (10.1016/j.tcs.2016.04.047_br0160) 2009; 34 Iwama (10.1016/j.tcs.2016.04.047_br0250) 1989; 18 Birnbaum (10.1016/j.tcs.2016.04.047_br0110) 1999; 10 Wei (10.1016/j.tcs.2016.04.047_br0190) 2004 Kroc (10.1016/j.tcs.2016.04.047_br0230) 2011; 184 Wei (10.1016/j.tcs.2016.04.047_br0180) 2005 Yin (10.1016/j.tcs.2016.04.047_br0270) 2009; 20 Li (10.1016/j.tcs.2016.04.047_br0080) 2011; 40 Davis (10.1016/j.tcs.2016.04.047_br0120) 1962; 5 Domshlak (10.1016/j.tcs.2016.04.047_br0090) 2007; 30 Lin (10.1016/j.tcs.2016.04.047_br0240) 2003; 31 Bacchus (10.1016/j.tcs.2016.04.047_br0070) 2003 |
| References_xml | – start-page: 424 year: 2006 end-page: 429 ident: br0150 article-title: SharpSAT-counting models with advanced component caching and implicit BCP publication-title: Ninth International Conference on Theory and Applications of Satisfiability Testing – start-page: 2688 year: 2014 end-page: 2694 ident: br0170 article-title: Preprocessing for propositional model counting publication-title: Twenty-Eighth National Conference on Artificial Intelligence – volume: 184 start-page: 209 year: 2011 end-page: 231 ident: br0060 article-title: Leveraging belief propagation, backtrack search, and statistics for model counting publication-title: Ann. Oper. Res. – start-page: 198 year: 2007 end-page: 203 ident: br0220 article-title: Approximate counting by sampling the backtrackfree search space publication-title: Twenty-Second National Conference on Artificial Intelligence – volume: 10 start-page: 349 year: 1990 end-page: 365 ident: br0290 article-title: Approximate inclusion–exclusion publication-title: Combinatorica – volume: 184 start-page: 209 year: 2011 end-page: 231 ident: br0230 article-title: Leveraging belief propagation, backtrack search, and statistics for model counting publication-title: Ann. Oper. Res. – volume: 31 start-page: 11 year: 2003 end-page: 21 ident: br0240 article-title: Theorem proving based on extension rule publication-title: J. Automat. Reason. – volume: 40 start-page: 729 year: 2011 end-page: 765 ident: br0080 article-title: Exploiting structure in weighted model counting approaches to probabilistic inference publication-title: J. Artificial Intelligence Res. – start-page: 2293 year: 2007 end-page: 2299 ident: br0210 article-title: From sampling to model counting publication-title: Twentieth International Joint Conference on Artificial Intelligence – volume: vol. 3 start-page: 89 year: 2008 end-page: 134 ident: br0010 article-title: Satisfiability solvers. Handbook of knowledge representation publication-title: Found. Artif. Intell. – start-page: 324 year: 2005 end-page: 339 ident: br0180 article-title: A new approach to model counting publication-title: Eighth International Conference on Theory and Applications of Satisfiability Testing – start-page: 157 year: 2000 end-page: 162 ident: br0130 article-title: Counting models using connected components publication-title: Seventeenth National Conference on Artificial Intelligence – volume: 34 start-page: 391 year: 2009 end-page: 442 ident: br0160 article-title: Solving #SAT and Bayesian inference with backtracking search publication-title: J. Artificial Intelligence Res. – volume: 193 start-page: 45 year: 2012 end-page: 86 ident: br0020 article-title: Planning as satisfiability: heuristics publication-title: Artificial Intelligence – start-page: 340 year: 2003 end-page: 351 ident: br0070 article-title: Algorithms and complexity results for #SAT and Bayesian inference publication-title: 44th Symposium on Foundations of Computer Science – start-page: 521 year: 1993 end-page: 532 ident: br0310 article-title: Local search strategies for satisfiability testing publication-title: Second DIMACS Challenge on Cliques, Coloring and Satisfiability – volume: 30 start-page: 565 year: 2007 end-page: 620 ident: br0090 article-title: Probabilistic planning via heuristic forward search and weighted model counting publication-title: J. Artificial Intelligence Res. – volume: 10 start-page: 457 year: 1999 end-page: 477 ident: br0110 article-title: The good old Davis–Putnam procedure helps counting models publication-title: J. Artificial Intelligence Res. – volume: 5 start-page: 394 year: 1962 end-page: 397 ident: br0120 article-title: A machine program for theorem-proving publication-title: Commun. ACM – volume: 36 start-page: 146 year: 2012 end-page: 154 ident: br0030 article-title: On the utility of landmarks in SAT based planning publication-title: Knowl.-Based Syst. – start-page: 1916 year: 2007 end-page: 1917 ident: br0260 article-title: Counting models using extension rules publication-title: Twenty-Second National Conference on Artificial Intelligence – volume: 16 start-page: 465 year: 1996 end-page: 477 ident: br0300 article-title: Inclusion–exclusion: exact and approximate publication-title: Combinatorica – volume: vol. 6695 start-page: 362 year: 2011 end-page: 363 ident: br0280 article-title: Model counting using the inclusion–exclusion principle publication-title: 14th International Conference on Theory and Applications of Satisfiability Testing – start-page: 70 year: 2002 end-page: 76 ident: br0100 article-title: A model counting characterization of diagnoses publication-title: 13th International Workshop on Principles of Diagnosis – start-page: 670 year: 2004 end-page: 676 ident: br0190 article-title: Towards efficient sampling: exploiting random walk strategies publication-title: Nineteenth National Conference on Artificial Intelligence – volume: 27 start-page: 329 year: 2014 end-page: 344 ident: br0040 article-title: Towards a theory of random walk planning: regress factors, fair homogeneous graphs and extensions publication-title: AI Commun. – volume: 20 start-page: 1714 year: 2009 end-page: 1725 ident: br0270 article-title: Solving #SAT using extension rules publication-title: J. Softw. – volume: vol. 185 start-page: 633 year: 2009 end-page: 654 ident: br0050 article-title: Model counting, handbook of satisfiability publication-title: Frontiers Artificial Intelligence Appl. – start-page: 20 year: 2004 end-page: 28 ident: br0140 article-title: Combining component caching and clause learning for effective model counting publication-title: Seventh International Conference on Theory and Applications of Satisfiability Testing – volume: 43 start-page: 169 year: 1986 end-page: 188 ident: br0200 article-title: Random generation of combinatorial structures from a uniform distribution publication-title: Theoret. Comput. Sci. – volume: 18 start-page: 385 year: 1989 end-page: 391 ident: br0250 article-title: CNF satisfiability test by counting and polynomial average time publication-title: SIAM J. Comput. – start-page: 340 year: 2003 ident: 10.1016/j.tcs.2016.04.047_br0070 article-title: Algorithms and complexity results for #SAT and Bayesian inference – volume: 10 start-page: 349 issue: 4 year: 1990 ident: 10.1016/j.tcs.2016.04.047_br0290 article-title: Approximate inclusion–exclusion publication-title: Combinatorica doi: 10.1007/BF02128670 – start-page: 157 year: 2000 ident: 10.1016/j.tcs.2016.04.047_br0130 article-title: Counting models using connected components – volume: 36 start-page: 146 year: 2012 ident: 10.1016/j.tcs.2016.04.047_br0030 article-title: On the utility of landmarks in SAT based planning publication-title: Knowl.-Based Syst. doi: 10.1016/j.knosys.2012.06.011 – volume: 31 start-page: 11 issue: 1 year: 2003 ident: 10.1016/j.tcs.2016.04.047_br0240 article-title: Theorem proving based on extension rule publication-title: J. Automat. Reason. doi: 10.1023/A:1027339205632 – start-page: 324 year: 2005 ident: 10.1016/j.tcs.2016.04.047_br0180 article-title: A new approach to model counting – start-page: 1916 year: 2007 ident: 10.1016/j.tcs.2016.04.047_br0260 article-title: Counting models using extension rules – volume: 27 start-page: 329 issue: 4 year: 2014 ident: 10.1016/j.tcs.2016.04.047_br0040 article-title: Towards a theory of random walk planning: regress factors, fair homogeneous graphs and extensions publication-title: AI Commun. doi: 10.3233/AIC-140603 – start-page: 670 year: 2004 ident: 10.1016/j.tcs.2016.04.047_br0190 article-title: Towards efficient sampling: exploiting random walk strategies – start-page: 70 year: 2002 ident: 10.1016/j.tcs.2016.04.047_br0100 article-title: A model counting characterization of diagnoses – start-page: 20 year: 2004 ident: 10.1016/j.tcs.2016.04.047_br0140 article-title: Combining component caching and clause learning for effective model counting – start-page: 198 year: 2007 ident: 10.1016/j.tcs.2016.04.047_br0220 article-title: Approximate counting by sampling the backtrackfree search space – volume: 34 start-page: 391 year: 2009 ident: 10.1016/j.tcs.2016.04.047_br0160 article-title: Solving #SAT and Bayesian inference with backtracking search publication-title: J. Artificial Intelligence Res. doi: 10.1613/jair.2648 – volume: 30 start-page: 565 year: 2007 ident: 10.1016/j.tcs.2016.04.047_br0090 article-title: Probabilistic planning via heuristic forward search and weighted model counting publication-title: J. Artificial Intelligence Res. doi: 10.1613/jair.2289 – volume: vol. 6695 start-page: 362 year: 2011 ident: 10.1016/j.tcs.2016.04.047_br0280 article-title: Model counting using the inclusion–exclusion principle – volume: 184 start-page: 209 issue: 1 year: 2011 ident: 10.1016/j.tcs.2016.04.047_br0230 article-title: Leveraging belief propagation, backtrack search, and statistics for model counting publication-title: Ann. Oper. Res. doi: 10.1007/s10479-009-0680-7 – start-page: 424 year: 2006 ident: 10.1016/j.tcs.2016.04.047_br0150 article-title: SharpSAT-counting models with advanced component caching and implicit BCP – start-page: 2293 year: 2007 ident: 10.1016/j.tcs.2016.04.047_br0210 article-title: From sampling to model counting – volume: 16 start-page: 465 issue: 4 year: 1996 ident: 10.1016/j.tcs.2016.04.047_br0300 article-title: Inclusion–exclusion: exact and approximate publication-title: Combinatorica doi: 10.1007/BF01271266 – volume: 18 start-page: 385 issue: 2 year: 1989 ident: 10.1016/j.tcs.2016.04.047_br0250 article-title: CNF satisfiability test by counting and polynomial average time publication-title: SIAM J. Comput. doi: 10.1137/0218026 – volume: 184 start-page: 209 issue: 1 year: 2011 ident: 10.1016/j.tcs.2016.04.047_br0060 article-title: Leveraging belief propagation, backtrack search, and statistics for model counting publication-title: Ann. Oper. Res. doi: 10.1007/s10479-009-0680-7 – volume: 40 start-page: 729 year: 2011 ident: 10.1016/j.tcs.2016.04.047_br0080 article-title: Exploiting structure in weighted model counting approaches to probabilistic inference publication-title: J. Artificial Intelligence Res. doi: 10.1613/jair.3232 – volume: 5 start-page: 394 issue: 7 year: 1962 ident: 10.1016/j.tcs.2016.04.047_br0120 article-title: A machine program for theorem-proving publication-title: Commun. ACM doi: 10.1145/368273.368557 – volume: 43 start-page: 169 year: 1986 ident: 10.1016/j.tcs.2016.04.047_br0200 article-title: Random generation of combinatorial structures from a uniform distribution publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(86)90174-X – start-page: 521 year: 1993 ident: 10.1016/j.tcs.2016.04.047_br0310 article-title: Local search strategies for satisfiability testing – volume: 20 start-page: 1714 issue: 7 year: 2009 ident: 10.1016/j.tcs.2016.04.047_br0270 article-title: Solving #SAT using extension rules publication-title: J. Softw. doi: 10.3724/SP.J.1001.2009.03320 – volume: vol. 185 start-page: 633 year: 2009 ident: 10.1016/j.tcs.2016.04.047_br0050 article-title: Model counting, handbook of satisfiability – volume: vol. 3 start-page: 89 year: 2008 ident: 10.1016/j.tcs.2016.04.047_br0010 article-title: Satisfiability solvers. Handbook of knowledge representation – start-page: 2688 year: 2014 ident: 10.1016/j.tcs.2016.04.047_br0170 article-title: Preprocessing for propositional model counting – volume: 193 start-page: 45 year: 2012 ident: 10.1016/j.tcs.2016.04.047_br0020 article-title: Planning as satisfiability: heuristics publication-title: Artificial Intelligence doi: 10.1016/j.artint.2012.08.001 – volume: 10 start-page: 457 year: 1999 ident: 10.1016/j.tcs.2016.04.047_br0110 article-title: The good old Davis–Putnam procedure helps counting models publication-title: J. Artificial Intelligence Res. doi: 10.1613/jair.601 |
| SSID | ssj0000576 |
| Score | 2.204666 |
| Snippet | Model counting is the problem of computing the number of models or satisfying assignments for a given propositional formula, and is #P-complete. Owing to its... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 28 |
| SubjectTerms | Extension rule Model counting Propositional satisfiability Resolution principle |
| Title | Two approximate algorithms for model counting |
| URI | https://dx.doi.org/10.1016/j.tcs.2016.04.047 |
| Volume | 657 |
| WOSCitedRecordID | wos000390971400005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwED5BxwM8bDCY2PihPPBElSlxnTh-nNDQQDAhUVB5iq6O02Wq0qnNoPvvd47tJtoAARJSFKWRnVr-TufP9vk7gFeKaTXiUxaWEdchj1kaTpOkICLHBZYY6aJV5__6QZyeZpOJ_ORS3K_adAKirrP1Wl78V6jpHYFtjs7-Bdybj9ILeibQ6U6w0_3PgP-xsErh64rYqB7ifLZYVs2ZVV6wqW-GPkVEn5uOe2calUv2MHQjZLfu7iJ4q_qqs6tvlQvBr2dnuNiUvXQlZ_Oqv7gQi3ZxoZuK3j71Yk9amd0UaTOeHGrrODMhQ8ZswmLvWVOrPe19Y9YbZa3Syy3_bZcSzg8bZaTU47SVobWSnDdksT-bVphGEKE0GnbpXdhiIpHZALaO3h1P3nfjcSLsjrVrtd_bbqP8bvzRz9lJj3GMH8K2myoERxbiR3BH17uw49NwBM4r78KDjxvp3dVjCAn_oId_0OEfEP5Bi3_g8X8CX94ej9-chC4nRqiYFE3Iy5KlGBWRxEzrqeG8HGWKRNQUcVnNaNAoS-KVAtlUqYJ-FREqjTTRF3ERj_ZgUC9q_RQClEQGhSJ-iglnyGQ8QhNoqgtEmkQX-xD5vsiVE4w3eUvmuY8MPM-p-3LTfXnE6RL78HpT5cKqpfyuMPcdnDtjtjQuJ2v4dbWDf6v2DO53Bv4cBs3yUr-Ae-p7U62WL53NXAP9y3d0 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Two+approximate+algorithms+for+model+counting&rft.jtitle=Theoretical+computer+science&rft.au=Wang%2C+Jinyan&rft.au=Yin%2C+Minghao&rft.au=Wu%2C+Jingli&rft.date=2017-01-02&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=657&rft.spage=28&rft.epage=37&rft_id=info:doi/10.1016%2Fj.tcs.2016.04.047&rft.externalDocID=S0304397516302316 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |