{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:05Z","timestamp":1750306085368,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T00:00:00Z","timestamp":1496361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,2]]},"DOI":"10.1145\/3094243.3094250","type":"proceedings-article","created":{"date-parts":[[2017,6,26]],"date-time":"2017-06-26T12:13:28Z","timestamp":1498479208000},"page":"46-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Research of Branching Heuristic Strategy for Implied Literal in Shortest Clause for SAT Problem"],"prefix":"10.1145","author":[{"given":"Rong","family":"Hu","sequence":"first","affiliation":[{"name":"National-Local Joint Engineering Laboratory of System Credibility Automatic Verification, Southwest Jiaotong University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/244522.244560"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/378239.379017"},{"volume-title":"Proceedings of Design Automation and Test in Europe(DATE)","author":"Goldberg E.","key":"e_1_3_2_1_3_1"},{"doi-asserted-by":"crossref","unstructured":"E\u00e9n N. and S\u00f6rensson N. 2003. An Extensible SAT-solver. Theory and Applications of Satisfiability Testing. Springer Berlin Heidelberg 502--518.  E\u00e9n N. and S\u00f6rensson N. 2003. An Extensible SAT-solver. Theory and Applications of Satisfiability Testing. Springer Berlin Heidelberg 502--518.","key":"e_1_3_2_1_4_1","DOI":"10.1007\/978-3-540-24605-3_37"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.5555\/648233.753307"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/3-540-61551-2_65"},{"key":"e_1_3_2_1_7_1","volume-title":"LNCS (LNAI)","volume":"1695","author":"Marques-Silva J.","year":"1999"},{"unstructured":"Informatik R. Buro M. and Buning H. K. 2002. Report on a sat competition. Technical report University of Paderborn.  Informatik R. Buro M. and Buning H. K. 2002. Report on a sat competition. Technical report University of Paderborn.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"crossref","unstructured":"Dubois O. Andre P. Boufkhad Y. and Carlier J. 1996. SAT versus UNSAT. In D. S.Johnson and M. A. Trick editors Second DIMACS Implementation Challenge. American Mathematical Society.  Dubois O. Andre P. Boufkhad Y. and Carlier J. 1996. SAT versus UNSAT. In D. S.Johnson and M. A. Trick editors Second DIMACS Implementation Challenge. American Mathematical Society.","key":"e_1_3_2_1_9_1","DOI":"10.1090\/dimacs\/026\/20"},{"unstructured":"Freeman J. W. 1996. Improvements to Propositional Satisfiability Search Algorithms.PhD thesis University of Pennsylvania Philadelphia PA.   Freeman J. W. 1996. Improvements to Propositional Satisfiability Search Algorithms.PhD thesis University of Pennsylvania Philadelphia PA.","key":"e_1_3_2_1_10_1"},{"doi-asserted-by":"crossref","unstructured":"Pretolani D. 1995. Efficiency and stability of hypergraph sat algorithms. In D. S.Johnson and M. A. Trick editors Second DIMACS Implementation Challenge.American Mathematical Society.  Pretolani D. 1995. Efficiency and stability of hypergraph sat algorithms. In D. S.Johnson and M. A. Trick editors Second DIMACS Implementation Challenge.American Mathematical Society.","key":"e_1_3_2_1_11_1","DOI":"10.1090\/dimacs\/026\/23"},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence, 155--160","author":"Zabih R.","key":"e_1_3_2_1_12_1"},{"volume-title":"Technical Report MPI-I-2-003, MPI.","year":"1995","author":"Stadtwald I.","key":"e_1_3_2_1_13_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/BF00881805"},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","volume-title":"B\u00fcning","author":"Biere A.","year":"2008"},{"unstructured":"Ryan L. 2004. Efficient algorithms for clause-learning SAT solvers. Master's thesis Simon Fraser University.  Ryan L. 2004. Efficient algorithms for clause-learning SAT solvers. Master's thesis Simon Fraser University.","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"crossref","unstructured":"Biere A. and Frohlich A. 2015. Evaluating CDCL variable scoring schemes. In Theory and Applications of Satisfiability Testing--SAT 2015. Springer International Publishing. 405--422.  Biere A. and Frohlich A. 2015. Evaluating CDCL variable scoring schemes. In Theory and Applications of Satisfiability Testing--SAT 2015. Springer International Publishing. 405--422.","key":"e_1_3_2_1_17_1","DOI":"10.1007\/978-3-319-24318-4_29"},{"unstructured":"Chen J. C. 2012. A Dynamic Phase Selection Strategy for Satisfiability Solvers.DOI=http:\/\/arxiv.org\/abs\/1208.1613.  Chen J. C. 2012. A Dynamic Phase Selection Strategy for Satisfiability Solvers.DOI=http:\/\/arxiv.org\/abs\/1208.1613.","key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"crossref","unstructured":"Guo Y. Zhang C.S. and Zhang B. 2016. Research progress on Algorithms for solving SAT problems. computer science 8--17.  Guo Y. Zhang C.S. and Zhang B. 2016. Research progress on Algorithms for solving SAT problems. computer science 8--17.","key":"e_1_3_2_1_19_1","DOI":"10.46298\/dmtcs.2159"},{"unstructured":"Zhao S. Y. 2008. Solving SAT problem based on Clause weight. Fudan University.  Zhao S. Y. 2008. Solving SAT problem based on Clause weight. Fudan University.","key":"e_1_3_2_1_20_1"}],"event":{"sponsor":["Southwest Jiaotong University"],"acronym":"ICDLT '17","name":"ICDLT '17: 2017 International Conference on Deep Learning Technologies","location":"Chengdu China"},"container-title":["Proceedings of the 2017 International Conference on Deep Learning Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3094243.3094250","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3094243.3094250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:16Z","timestamp":1750217416000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3094243.3094250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,2]]},"references-count":20,"alternative-id":["10.1145\/3094243.3094250","10.1145\/3094243"],"URL":"https:\/\/doi.org\/10.1145\/3094243.3094250","relation":{},"subject":[],"published":{"date-parts":[[2017,6,2]]},"assertion":[{"value":"2017-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}