{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T09:11:48Z","timestamp":1783674708417,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,12,3]],"date-time":"2015-12-03T00:00:00Z","timestamp":1449100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,12,3]]},"DOI":"10.1145\/2833258.2833293","type":"proceedings-article","created":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T13:42:32Z","timestamp":1447854152000},"page":"46-53","source":"Crossref","is-referenced-by-count":15,"title":["A New Method to Encode the At-Most-One Constraint into SAT"],"prefix":"10.1145","author":[{"given":"Van-Hau","family":"Nguyen","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, Hung Yen University of Technology and Education, Vietnam"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Son T.","family":"Mai","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, University of Transport, HoChiMinh City, Vietnam"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,12,3]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"256","volume-title":"AAAI\/IAAI","author":"Achlioptas D.","year":"2000"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"C. Ans\u00f3tegui and F. Many\u00e0 . Mapping problems with finite-domain variables to problems with boolean variables. In H. H. Hoos and D. G. Mitchell editors SAT (Selected Papers volume 3542 of Lecture Notes in Computer Science pages 1 -- 15 . Springer 2004 . 10.1007\/11527695_1 C. Ans\u00f3tegui and F. Many\u00e0. Mapping problems with finite-domain variables to problems with boolean variables. In H. H. Hoos and D. G. Mitchell editors SAT (Selected Papers volume 3542 of Lecture Notes in Computer Science pages 1--15. Springer 2004. 10.1007\/11527695_1","DOI":"10.1007\/11527695_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"J. Argelich A. Cabiscol I. Lynce and F. Many\u00e0 . Sequential Encodings from Max-CSP into Partial Max-SAT. In O. Kullmann editor SAT volume 5584 of Lecture Notes in Computer Science pages 161 -- 166 . Springer 2009 . 10.1007\/978-3-642-02777-2_17 J. Argelich A. Cabiscol I. Lynce and F. Many\u00e0. Sequential Encodings from Max-CSP into Partial Max-SAT. In O. Kullmann editor SAT volume 5584 of Lecture Notes in Computer Science pages 161--166. Springer 2009. 10.1007\/978-3-642-02777-2_17","DOI":"10.1007\/978-3-642-02777-2_17"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2010.17"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-010-9105-0"},{"key":"e_1_3_2_1_6_1","volume-title":"Nguyen. Extra Constraints for the Social Golfers Problem. In 13th International Conference on Logic for Programming Artificial Intelligence and Reasoning-LPAR 2006, Short Papers Proceedings","author":"Azevedo F.","year":"2006"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"O. Bailleux and Y. Boufkhad . Efficient CNF Encoding of Boolean Cardinality Constraints. In F. Rossi editor CP volume 2833 of Lecture Notes in Computer Science pages 108 -- 122 . Springer 2003 . O. Bailleux and Y. Boufkhad. Efficient CNF Encoding of Boolean Cardinality Constraints. In F. Rossi editor CP volume 2833 of Lecture Notes in Computer Science pages 108--122. Springer 2003.","DOI":"10.1007\/978-3-540-45193-8_8"},{"key":"e_1_3_2_1_8_1","volume-title":"ISAIM","author":"Barahona P.","year":"2014"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"P. Barahona S. H\u00f6lldobler and V.-H. Nguyen . Representative Encodings to Translate Finite CSPs into SAT. In H. Simonis editor CPAIOR volume 8451 of Lecture Notes in Computer Science pages 251 -- 267 . Springer 2014 . P. Barahona S. H\u00f6lldobler and V.-H. Nguyen. Representative Encodings to Translate Finite CSPs into SAT. In H. Simonis editor CPAIOR volume 8451 of Lecture Notes in Computer Science pages 251--267. Springer 2014.","DOI":"10.1007\/978-3-319-07046-9_18"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Y. Ben-Haim A. Ivrii O. Margalit and A. Matsliah . Perfect Hashing and CNF Encodings of Cardinality Constraints. In A. Cimatti and R. Sebastiani editors SAT volume 7317 of Lecture Notes in Computer Science pages 397 -- 409 . Springer 2012 . 10.1007\/978-3-642-31612-8_30 Y. Ben-Haim A. Ivrii O. Margalit and A. Matsliah. Perfect Hashing and CNF Encodings of Cardinality Constraints. In A. Cimatti and R. Sebastiani editors SAT volume 7317 of Lecture Notes in Computer Science pages 397--409. Springer 2012. 10.1007\/978-3-642-31612-8_30","DOI":"10.1007\/978-3-642-31612-8_30"},{"key":"e_1_3_2_1_11_1","volume-title":"Elsevier","author":"Bessiere C.","year":"2006"},{"key":"e_1_3_2_1_12_1","first-page":"51","volume-title":"Proceedings of SAT Competition 2013","author":"Biere A.","year":"2013"},{"key":"e_1_3_2_1_13_1","unstructured":"A. Biere M. Heule H. van Maaren and T. Walsh editors . Handbook of Satisfiability volume 185 of Frontiers in Artificial Intelligence and Applications . IOS Press 2009 . A. Biere M. Heule H. van Maaren and T. Walsh editors. Handbook of Satisfiability volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press 2009."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of the Tenth Int. Workshop of Constraint Modelling and Reformulation","author":"Chen J.-C.","year":"2010"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190014"},{"key":"e_1_3_2_1_16_1","first-page":"226","volume-title":"KDD","author":"Ester M.","year":"1996"},{"key":"e_1_3_2_1_17_1","volume-title":"Some Slow. In Proc. of the Tenth Int. Workshop of Constraint Modelling and Reformulation","author":"Frisch A. M.","year":"2010"},{"key":"e_1_3_2_1_18_1","first-page":"282","volume-title":"Solving Non-Boolean Satisfiability Problems with Stochastic Local Search. In in Proc. IJCAI-01","author":"Frisch A. M.","year":"2001"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-005-9011-0"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"M. Gebser B. Kaufmann and T. Schaub . The Conflict-Driven Answer Set Solver clasp: Progress Report. In E. Erdem F. Lin and T. Schaub editors LPNMR volume 5753 of Lecture Notes in Computer Science pages 509 -- 514 . Springer 2009 . 10.1007\/978-3-642-04238-6_50 M. Gebser B. Kaufmann and T. Schaub. The Conflict-Driven Answer Set Solver clasp: Progress Report. In E. Erdem F. Lin and T. Schaub editors LPNMR volume 5753 of Lecture Notes in Computer Science pages 509--514. Springer 2009. 10.1007\/978-3-642-04238-6_50","DOI":"10.1007\/978-3-642-04238-6_50"},{"key":"e_1_3_2_1_21_1","first-page":"121","volume-title":"Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI'2002","author":"Gent I. P.","year":"2002"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"I. P. Gent and T. Walsh . CSPLib : A Benchmark Library for Constraints. In J. Jaffar editor CP volume 1713 of Lecture Notes in Computer Science pages 480 -- 481 . Springer Berlin Heidelberg 1999 . I. P. Gent and T. Walsh. CSPLib : A Benchmark Library for Constraints. In J. Jaffar editor CP volume 1713 of Lecture Notes in Computer Science pages 480--481. Springer Berlin Heidelberg 1999.","DOI":"10.1007\/978-3-540-48085-3_36"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020585"},{"key":"e_1_3_2_1_24_1","volume-title":"Germany","author":"H\u00f6lldobler S.","year":"2013"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.004"},{"key":"e_1_3_2_1_26_1","volume-title":"the Fourth Workshop on Constraint in Formal Verification(CFV)","author":"Klieber W.","year":"2007"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.30"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.95"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.13"},{"key":"e_1_3_2_1_30_1","unstructured":"S. T. Mai X. He J. Feng C. Plant and C. B\u00f6hm. Anytime Density-based Clustering of Complex Data. Knowledge and Information System (KAIS) (to appear). 10.1007\/s10115-014-0797-0 S. T. Mai X. He J. Feng C. Plant and C. B\u00f6hm. Anytime Density-based Clustering of Complex Data. Knowledge and Information System (KAIS) (to appear). 10.1007\/s10115-014-0797-0"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.39"},{"key":"e_1_3_2_1_32_1","unstructured":"N. Manthey . The SAT Solver RISS3G at SC 2013. volume B-2013- 1 of Department of Computer Science Series of Publications B pages 72 -- 73 . University of Helsinki Helsinki Finland 2013 . N. Manthey. The SAT Solver RISS3G at SC 2013. volume B-2013-1 of Department of Computer Science Series of Publications B pages 72--73. University of Helsinki Helsinki Finland 2013."},{"key":"e_1_3_2_1_33_1","volume-title":"Practical Applications of Boolean Satisfiability. In In Workshop on Discrete Event Systems (WODES. IEEE Press","author":"J.","year":"2008"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676585.2676605"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2013.154"},{"key":"e_1_3_2_1_36_1","volume-title":"ISTE","author":"Prestwich S. D.","year":"2007"},{"key":"e_1_3_2_1_37_1","unstructured":"S. D. Prestwich . CNF Encodings. In A. Biere M. Heule H. van Maaren and T. Walsh editors Handbook of Satisfiability volume 185 of Frontiers in Artificial Intelligence and Applications pages 75 -- 97 . IOS Press 2009 . S. D. Prestwich. CNF Encodings. In A. Biere M. Heule H. van Maaren and T. Walsh editors Handbook of Satisfiability volume 185 of Frontiers in Artificial Intelligence and Applications pages 75--97. IOS Press 2009."},{"key":"e_1_3_2_1_38_1","volume-title":"Elsevier Science Inc.","author":"Rossi F.","year":"2006"},{"key":"e_1_3_2_1_39_1","unstructured":"J. M. Silva and I. Lynce . Towards Robust CNF Encodings of Cardinality Constraints. In C. Bessiere editor CP volume 4741 of Lecture Notes in Computer Science pages 483 -- 497 . Springer 2007 . J. M. Silva and I. Lynce. Towards Robust CNF Encodings of Cardinality Constraints. In C. Bessiere editor CP volume 4741 of Lecture Notes in Computer Science pages 483--497. Springer 2007."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"C. Sinz . Towards an Optimal CNF Encoding of Boolean Cardinality Constraints. In P. van Beek editor CP volume 3709 of Lecture Notes in Computer Science pages 827 -- 831 . Springer 2005 . C. Sinz. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints. In P. van Beek editor CP volume 3709 of Lecture Notes in Computer Science pages 827--831. Springer 2005.","DOI":"10.1007\/11564751_73"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9061-0"},{"key":"e_1_3_2_1_42_1","first-page":"135","volume-title":"ICCAD","author":"Velev M. N.","year":"2007"},{"key":"e_1_3_2_1_43_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP2000","author":"Walsh T.","year":"2000"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00144-6"}],"event":{"name":"SoICT 2015: The Sixth International Symposium on Information and Communication Technology","location":"Hue City Viet Nam","acronym":"SoICT 2015","sponsor":["SOICT School of Information and Communication Technology - HUST","NAFOSTED The National Foundation for Science and Technology Development"]},"container-title":["Proceedings of the Sixth International Symposium on Information and Communication Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2833258.2833293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2833258.2833293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:48Z","timestamp":1750225728000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2833258.2833293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,3]]},"references-count":44,"alternative-id":["10.1145\/2833258.2833293","10.1145\/2833258"],"URL":"https:\/\/doi.org\/10.1145\/2833258.2833293","relation":{},"subject":[],"published":{"date-parts":[[2015,12,3]]}}}