{"id":"https://openalex.org/W4413795501","doi":"https://doi.org/10.1017/s1471068425100197","title":"GPU Accelerated Compact-Table Propagation","display_name":"GPU Accelerated Compact-Table Propagation","publication_year":2025,"publication_date":"2025-07-01","ids":{"openalex":"https://openalex.org/W4413795501","doi":"https://doi.org/10.1017/s1471068425100197"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068425100197","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068425100197","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/44101120098C09AAA908BB8DEB7D1397/S1471068425100197a.pdf/div-class-title-gpu-accelerated-compact-table-propagation-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/44101120098C09AAA908BB8DEB7D1397/S1471068425100197a.pdf/div-class-title-gpu-accelerated-compact-table-propagation-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090144912","display_name":"Enrico Santi","orcid":"https://orcid.org/0000-0001-6135-0096"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"ENRICO SANTI","raw_affiliation_strings":["University of Udine","DMIF, University of Udine, Udine, Italy (e-mails:"],"raw_orcid":"https://orcid.org/0009-0008-3556-7177","affiliations":[{"raw_affiliation_string":"University of Udine","institution_ids":["https://openalex.org/I129043915"]},{"raw_affiliation_string":"DMIF, University of Udine, Udine, Italy (e-mails:","institution_ids":["https://openalex.org/I129043915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064407367","display_name":"Agostino Dovier","orcid":"https://orcid.org/0000-0003-2052-8593"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"AGOSTINO DOVIER","raw_affiliation_strings":["University of Udine","DMIF, University of Udine, Udine, Italy (e-mails:"],"raw_orcid":"https://orcid.org/0000-0003-2052-8593","affiliations":[{"raw_affiliation_string":"University of Udine","institution_ids":["https://openalex.org/I129043915"]},{"raw_affiliation_string":"DMIF, University of Udine, Udine, Italy (e-mails:","institution_ids":["https://openalex.org/I129043915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049720199","display_name":"Andrea Formisano","orcid":"https://orcid.org/0000-0002-6755-9314"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"ANDREA FORMISANO","raw_affiliation_strings":["University of Udine","DMIF, University of Udine, Udine, Italy (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-6755-9314","affiliations":[{"raw_affiliation_string":"University of Udine","institution_ids":["https://openalex.org/I129043915"]},{"raw_affiliation_string":"DMIF, University of Udine, Udine, Italy (e-mails:","institution_ids":["https://openalex.org/I129043915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083876792","display_name":"Fabio Tardivo","orcid":"https://orcid.org/0000-0003-3328-2174"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"FABIO TARDIVO","raw_affiliation_strings":["New Mexico State University","Dept CS, New Mexico State University, Las Cruces, NM, USA (e-mail:"],"raw_orcid":"https://orcid.org/0000-0003-3328-2174","affiliations":[{"raw_affiliation_string":"New Mexico State University","institution_ids":["https://openalex.org/I10052268"]},{"raw_affiliation_string":"Dept CS, New Mexico State University, Las Cruces, NM, USA (e-mail:","institution_ids":["https://openalex.org/I10052268"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2111048,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"4","first_page":"756","last_page":"774"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.8065496683120728},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.7373630404472351},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6636282801628113},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.6602286100387573},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6422874331474304},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5446308851242065},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.46782320737838745},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4602329730987549},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.45574167370796204},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.4479769468307495},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.44716015458106995},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4441644847393036},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.4427779018878937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39861559867858887},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3225439190864563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.321271151304245},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13379016518592834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11879965662956238},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.10648009181022644},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.09084105491638184}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8065496683120728},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7373630404472351},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6636282801628113},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.6602286100387573},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6422874331474304},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5446308851242065},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.46782320737838745},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4602329730987549},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.45574167370796204},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.4479769468307495},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.44716015458106995},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4441644847393036},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.4427779018878937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39861559867858887},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3225439190864563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.321271151304245},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13379016518592834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11879965662956238},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10648009181022644},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.09084105491638184},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068425100197","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068425100197","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/44101120098C09AAA908BB8DEB7D1397/S1471068425100197a.pdf/div-class-title-gpu-accelerated-compact-table-propagation-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2507.18413","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.18413","pdf_url":"https://arxiv.org/pdf/2507.18413","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:air.uniud.it:11390/1313084","is_oa":true,"landing_page_url":"https://hdl.handle.net/11390/1313084","pdf_url":null,"source":{"id":"https://openalex.org/S4306401163","display_name":"Institutional Research Information System (University of Udine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129043915","host_organization_name":"University of Udine","host_organization_lineage":["https://openalex.org/I129043915"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s1471068425100197","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068425100197","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/44101120098C09AAA908BB8DEB7D1397/S1471068425100197a.pdf/div-class-title-gpu-accelerated-compact-table-propagation-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320324979","display_name":"Universit\u00e0 degli Studi di Udine","ror":null},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413795501.pdf","grobid_xml":"https://content.openalex.org/works/W4413795501.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W581895261","https://openalex.org/W1494783798","https://openalex.org/W1510816548","https://openalex.org/W1607804604","https://openalex.org/W1990422819","https://openalex.org/W2010489986","https://openalex.org/W2027505077","https://openalex.org/W2125622056","https://openalex.org/W2749013940","https://openalex.org/W2962845465","https://openalex.org/W3126611880","https://openalex.org/W3216741911","https://openalex.org/W4232962645","https://openalex.org/W4379615318","https://openalex.org/W4403545609"],"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":{"Abstract":[0],"Constraint":[1],"Programming":[2,6],"developed":[3],"within":[4],"Logic":[5],"in":[7,81],"the":[8,40,49,93,143,147,162,183],"Eighties;":[9],"nowadays":[10],"all":[11],"Prolog":[12],"systems":[13],"encompass":[14],"modules":[15],"capable":[16],"of":[17,38,51,56,65,77,92,102,121,187,208],"handling":[18],"constraint":[19,29,196],"programming":[20],"on":[21,34,48,62,182,190,199,204],"finite":[22,66,75],"domains":[23],"demanding":[24],"their":[25],"solution":[26],"to":[27,45,99,113,129,173],"a":[28,35,63,74,100,205],"solver.":[30],"This":[31],"work":[32],"focuses":[33],"specific":[36],"form":[37],"constraint,":[39,43],"so-called":[41],"table":[42],"used":[44],"specify":[46],"conditions":[47],"values":[50],"variables":[52,68],"as":[53,73],"an":[54,194,200],"enumeration":[55],"alternative":[57],"options.":[58],"Since":[59],"every":[60],"condition":[61],"set":[64,76,207],"domain":[67],"can":[69,157],"be":[70,130,158],"ultimately":[71],"expressed":[72],"cases,":[78],"Table":[79,90,176],"can,":[80],"principle,":[82],"simulate":[83],"any":[84],"other":[85],"constraint.":[86],"These":[87],"characteristics":[88],"make":[89],"one":[91],"most":[94],"studied":[95],"constraints":[96],"ever,":[97],"leading":[98],"series":[101],"increasingly":[103],"efficient":[104],"propagation":[105,149],"algorithms.":[106],"Despite":[107],"this,":[108],"it":[109],"is":[110],"not":[111],"uncommon":[112],"encounter":[114],"real-world":[115],"problems":[116],"with":[117,133,142],"hundreds":[118],"or":[119],"thousands":[120],"valid":[122],"cases":[123],"that":[124],"are":[125],"simply":[126],"too":[127],"many":[128],"handled":[131],"effectively":[132],"standard":[134],"CPU-based":[135],"approaches.":[136],"In":[137,178],"this":[138],"paper,":[139],"we":[140,180],"deal":[141],"Compact-Table":[144],"(CT)":[145],"algorithm,":[146],"state-of-the-art":[148],"algorithms":[150],"for":[151],"Table.":[152],"We":[153],"describe":[154],"how":[155],"CT":[156],"enhanced":[159],"by":[160,167],"exploiting":[161],"massive":[163],"computational":[164],"power":[165],"offered":[166],"modern":[168],"Graphics":[169],"Processing":[170],"Units":[171],"(GPUs)":[172],"handle":[174],"large":[175],"constraints.":[177],"particular,":[179],"report":[181],"design":[184],"and":[185,198],"implementation":[186],"GPU-accelerated":[188],"CT,":[189],"its":[191],"integration":[192],"into":[193],"existing":[195],"solver,":[197],"experimental":[201],"validation":[202],"performed":[203],"significant":[206],"instances.":[209]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-08-29T00:00:00"}