乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:56:36Z","timestamp":1730314596981,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,9,7]]},"DOI":"10.1145\/1599410.1599442","type":"proceedings-article","created":{"date-parts":[[2009,9,8]],"date-time":"2009-09-08T08:53:09Z","timestamp":1252399989000},"page":"255-266","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A declarative encoding of telecommunications feature subscription in SAT"],"prefix":"10.1145","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer-Sheva, Israel"}]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[{"name":"Universidad Complutense de Madrid, Madrid, Spain"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[{"name":"University of Melbourne, Australia, Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2009,9,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/967030.967034"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_70"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11805618_2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068407003146"},{"volume-title":"Introduction to algorithms","year":"1990","author":"Cormen Thomas H.","key":"e_1_3_2_1_5_1","unstructured":"Thomas H. Cormen , Charles E. Leiserson , and Ronald L. Rivest . Introduction to algorithms . MIT Press and McGraw-Hill , 1990 . Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill, 1990."},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","first-page":"502","volume-title":"Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003 (Selected Revised Papers)","author":"E\u00e9n Niklas","year":"2004","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . An extensible SAT-solver . In Enrico Giunchiglia and Armando Tacchella, editors, Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003 (Selected Revised Papers) , volume 2919 of Lecture Notes in Computer Science , pages 502 -- 518 . Springer , 2004 . Niklas E\u00e9n and Niklas S\u00f6rensson. An extensible SAT-solver. In Enrico Giunchiglia and Armando Tacchella, editors, Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003 (Selected Revised Papers), volume 2919 of Lecture Notes in Computer Science, pages 502--518. Springer, 2004."},{"issue":"1","key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Translating pseudo-boolean constraints into sat","volume":"2","author":"E\u00e9n Niklas","year":"2006","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . Translating pseudo-boolean constraints into sat . JSAT , 2 ( 1-4 ): 1 -- 26 , 2006 . Niklas E\u00e9n and Niklas S\u00f6rensson. Translating pseudo-boolean constraints into sat. JSAT, 2(1-4):1--26, 2006.","journal-title":"JSAT"},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/11685654_14","volume-title":"Essays in Memory of Shimon Even","author":"Even Guy","year":"2006","unstructured":"Guy Even . On teaching fast adder designs: Revisiting ladner&fischer . In Oded Goldreich, Arnold L. Rosenberg, and Alan L. Selman, editors, Essays in Memory of Shimon Even , volume 3895 of Lecture Notes in Computer Science , pages 313 -- 347 . Springer , 2006 . ISBN 3-540-32880-7. Guy Even. On teaching fast adder designs: Revisiting ladner&fischer. In Oded Goldreich, Arnold L. Rosenberg, and Alan L. Selman, editors, Essays in Memory of Shimon Even, volume 3895 of Lecture Notes in Computer Science, pages 313--347. Springer, 2006. ISBN 3-540-32880-7."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Carla P.\n Gomes Henry\n Kautz Ashish\n Sabharwal and \n Bart\n Selman\n .\n Hand-book of Knowledge Representation volume \n 3\n of \n Foundations of Artificial Intelligence chapter Satisfiability Solvers pages \n 89\n --\n 134\n . \n Elsevier 2008\n . \n Editors\n : \n Frank\n van Harmelen Vladimir Lifschitz and Bruce Porter. Carla P. Gomes Henry Kautz Ashish Sabharwal and Bart Selman. Hand-book of Knowledge Representation volume 3 of Foundations of Artificial Intelligence chapter Satisfiability Solvers pages 89--134. Elsevier 2008. Editors: Frank van Harmelen Vladimir Lifschitz and Bruce Porter.","DOI":"10.1016\/S1574-6526(07)03002-7"},{"key":"e_1_3_2_1_10_1","first-page":"85","volume-title":"Reducibility among Combinatorial Problems","author":"Karp R.M.","year":"1972","unstructured":"R.M. Karp . Reducibility among Combinatorial Problems , pages 85 -- 103 . Plenum Press , 1972 . R.E. Miller and J.M. Thatcher (eds.). R.M. Karp. Reducibility among Combinatorial Problems, pages 85--103. Plenum Press, 1972. R.E. Miller and J.M. Thatcher (eds.)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85958-1_5"},{"volume-title":"http:\/\/www.cs.chalmers.se\/Cs\/Research\/FormalMethods\/MiniSat. Viewed","year":"2005","author":"SAT.","key":"e_1_3_2_1_12_1","unstructured":"Mini SAT. MiniSAT. http:\/\/www.cs.chalmers.se\/Cs\/Research\/FormalMethods\/MiniSat. Viewed December 2005 . MiniSAT. MiniSAT. http:\/\/www.cs.chalmers.se\/Cs\/Research\/FormalMethods\/MiniSat. Viewed December 2005."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_14_1","first-page":"1","volume-title":"Proceedings of the 13th International Workshop on Logic Programming Environments","author":"Wielemaker Jan","year":"2003","unstructured":"Jan Wielemaker . An overview of the SWI-Prolog programming environment. In Fred Mesnard and Alexander Serebenik, editors , Proceedings of the 13th International Workshop on Logic Programming Environments , pages 1 -- 16 , Heverlee, Belgium , December 2003 . Katholieke Universiteit Leuven. CW 371. Jan Wielemaker. An overview of the SWI-Prolog programming environment. In Fred Mesnard and Alexander Serebenik, editors, Proceedings of the 13th International Workshop on Logic Programming Environments, pages 1--16, Heverlee, Belgium, December 2003. Katholieke Universiteit Leuven. CW 371."},{"key":"e_1_3_2_1_15_1","first-page":"279 7249","volume-title":"ICCAD '01: Proceedings of the 2001 IEEE\/ACM international conference on Computer-aided design","author":"Zhang Lintao","year":"2001","unstructured":"Lintao Zhang , Conor F. Madigan , Matthew H. Moskewicz , and Sharad Malik . Efficient conflict driven learning in a boolean satisfiability solver . In ICCAD '01: Proceedings of the 2001 IEEE\/ACM international conference on Computer-aided design , pages 279 -- 285 , Piscataway, NJ, USA , 2001 . IEEE Press. ISBN 0-7803- 7249 - 7242 . Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz, and Sharad Malik. Efficient conflict driven learning in a boolean satisfiability solver. In ICCAD '01: Proceedings of the 2001 IEEE\/ACM international conference on Computer-aided design, pages 279--285, Piscataway, NJ, USA, 2001. IEEE Press. ISBN 0-7803-7249-2."}],"event":{"name":"PPDP '09: Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Coimbra Portugal","acronym":"PPDP '09"},"container-title":["Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1599410.1599442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T15:00:40Z","timestamp":1673449240000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1599410.1599442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,7]]},"references-count":15,"alternative-id":["10.1145\/1599410.1599442","10.1145\/1599410"],"URL":"https:\/\/doi.org\/10.1145\/1599410.1599442","relation":{},"subject":[],"published":{"date-parts":[[2009,9,7]]},"assertion":[{"value":"2009-09-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}