{"id":"https://openalex.org/W2246401527","doi":"https://doi.org/10.1145/2833258.2833293","title":"A New Method to Encode the At-Most-One Constraint into SAT","display_name":"A New Method to Encode the At-Most-One Constraint into SAT","publication_year":2015,"publication_date":"2015-11-18","ids":{"openalex":"https://openalex.org/W2246401527","doi":"https://doi.org/10.1145/2833258.2833293","mag":"2246401527"},"language":"en","primary_location":{"id":"doi:10.1145/2833258.2833293","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2833258.2833293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixth International Symposium on Information and Communication Technology","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020147099","display_name":"Van-Hau Nguyen","orcid":"https://orcid.org/0000-0002-3256-5626"},"institutions":[{"id":"https://openalex.org/I1285420085","display_name":"Hung Yen University of Technology and Education","ror":"https://ror.org/052yjgk16","country_code":"VN","type":"education","lineage":["https://openalex.org/I1285420085"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Van-Hau Nguyen","raw_affiliation_strings":["Faculty of Information Technology, Hung Yen University of Technology and Education, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Hung Yen University of Technology and Education, Vietnam","institution_ids":["https://openalex.org/I1285420085"]}]},{"author_position":"last","author":{"id":null,"display_name":"Son T. Mai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Son T. Mai","raw_affiliation_strings":["Faculty of Information Technology, University of Transport, HoChiMinh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, University of Transport, HoChiMinh City, Vietnam","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.972000002861023,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9591000080108643,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.795295000076294},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.7315969467163086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6667616963386536},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6091986298561096},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5536957383155823},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.49061694741249084},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4633192718029022},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4629232883453369},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.44598662853240967},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4406389594078064},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.41096773743629456},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37672704458236694},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24484708905220032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2272602617740631},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15254178643226624}],"concepts":[{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.795295000076294},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.7315969467163086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6667616963386536},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6091986298561096},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5536957383155823},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.49061694741249084},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4633192718029022},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4629232883453369},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.44598662853240967},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4406389594078064},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.41096773743629456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37672704458236694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24484708905220032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2272602617740631},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15254178643226624},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2833258.2833293","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2833258.2833293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixth International Symposium on Information and Communication Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W9380573","https://openalex.org/W82625556","https://openalex.org/W1585759996","https://openalex.org/W1604110421","https://openalex.org/W1673310716","https://openalex.org/W1721757222","https://openalex.org/W1745650241","https://openalex.org/W1794367353","https://openalex.org/W1946570941","https://openalex.org/W1987111416","https://openalex.org/W1990702478","https://openalex.org/W1999163438","https://openalex.org/W2012413542","https://openalex.org/W2033274122","https://openalex.org/W2064681502","https://openalex.org/W2068658305","https://openalex.org/W2081692349","https://openalex.org/W2095851248","https://openalex.org/W2100609826","https://openalex.org/W2102791214","https://openalex.org/W2104988143","https://openalex.org/W2116758077","https://openalex.org/W2117182791","https://openalex.org/W2118406528","https://openalex.org/W2141656507","https://openalex.org/W2144163060","https://openalex.org/W2155887940","https://openalex.org/W2157280385","https://openalex.org/W2395685674","https://openalex.org/W2396032095","https://openalex.org/W2415170901","https://openalex.org/W2605289564","https://openalex.org/W2918142118"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W1536604285","https://openalex.org/W1567852657","https://openalex.org/W2032348095","https://openalex.org/W1519282274","https://openalex.org/W2624275032","https://openalex.org/W2073925063","https://openalex.org/W1597500234","https://openalex.org/W2140769824"],"abstract_inverted_index":{"One":[0],"of":[1,10,102],"the":[2,8,22,33,36,61,78,103,108],"most":[3],"widely":[4,113],"used":[5,53,114],"constraints":[6],"during":[7],"process":[9],"translating":[11],"a":[12,16,29,99,112],"practical":[13],"problem":[14],"into":[15],"propositional":[17],"satisfiability":[18],"(SAT)":[19],"instance":[20],"is":[21,64],"at-most-one":[23],"(AMO)":[24],"constraint.":[25],"This":[26],"paper":[27],"proposes":[28],"new":[30,62,79],"encoding":[31,40,63,80,106],"for":[32],"AMO":[34,38,104,109],"constraint,":[35],"so-called":[37],"bimander":[39,105],"which":[41,50],"can":[42],"be":[43],"easily":[44],"extended":[45],"to":[46,84],"encode":[47],"cardinality":[48],"constraints,":[49],"are":[51],"often":[52],"in":[54,92,116],"constraint":[55,93],"programming.":[56,94],"Experimental":[57],"results":[58],"reveal":[59],"that":[60,77,98],"very":[65],"competitive":[66],"compared":[67],"with":[68],"all":[69,117],"other":[70],"state-of-the-art":[71],"encodings.":[72],"Furthermore,":[73],"we":[74],"will":[75],"prove":[76],"allows":[81],"unit":[82],"propagation":[83],"achieve":[85],"arc":[86],"consistency":[87],"-":[88],"an":[89],"important":[90],"technique":[91],"We":[95],"also":[96],"show":[97],"special":[100],"case":[101],"outperforms":[107],"binary":[110],"encoding,":[111,115],"our":[118],"experiments.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}