{"id":"https://openalex.org/W2023934846","doi":"https://doi.org/10.1145/1363686.1363725","title":"Splitting heuristics for disjunctive numerical constraints","display_name":"Splitting heuristics for disjunctive numerical constraints","publication_year":2008,"publication_date":"2008-03-16","ids":{"openalex":"https://openalex.org/W2023934846","doi":"https://doi.org/10.1145/1363686.1363725","mag":"2023934846"},"language":"en","primary_location":{"id":"doi:10.1145/1363686.1363725","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1363686.1363725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM symposium on Applied computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00421462","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060755871","display_name":"Thomas Douillard","orcid":null},"institutions":[{"id":"https://openalex.org/I97188460","display_name":"Nantes Universit\u00e9","ror":"https://ror.org/03gnr7b55","country_code":"FR","type":"education","lineage":["https://openalex.org/I97188460"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thomas Douillard","raw_affiliation_strings":["Universit\u00e9 de Nantes, France","Universite de Nantes, France;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Nantes, France","institution_ids":["https://openalex.org/I97188460"]},{"raw_affiliation_string":"Universite de Nantes, France;","institution_ids":["https://openalex.org/I97188460"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044508529","display_name":"Christophe Jermann","orcid":"https://orcid.org/0000-0002-1383-3103"},"institutions":[{"id":"https://openalex.org/I97188460","display_name":"Nantes Universit\u00e9","ror":"https://ror.org/03gnr7b55","country_code":"FR","type":"education","lineage":["https://openalex.org/I97188460"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christophe Jermann","raw_affiliation_strings":["Universit\u00e9 de Nantes, France","Universite de Nantes, France;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Nantes, France","institution_ids":["https://openalex.org/I97188460"]},{"raw_affiliation_string":"Universite de Nantes, France;","institution_ids":["https://openalex.org/I97188460"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97188460"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"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.9988999962806702,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9879000186920166,"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"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.98580002784729,"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/heuristics","display_name":"Heuristics","score":0.8292148113250732},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.704357385635376},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.641974925994873},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5324980020523071},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5183273553848267},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5076485872268677},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.43590646982192993},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4270189106464386},{"id":"https://openalex.org/keywords/numerical-analysis","display_name":"Numerical analysis","score":0.4211249351501465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3930603265762329},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3745735287666321},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3667609393596649},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.26735585927963257},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08344298601150513}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8292148113250732},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.704357385635376},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.641974925994873},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5324980020523071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5183273553848267},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5076485872268677},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.43590646982192993},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4270189106464386},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.4211249351501465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3930603265762329},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3745735287666321},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3667609393596649},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.26735585927963257},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08344298601150513},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1363686.1363725","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1363686.1363725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM symposium on Applied computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.592.8476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.8476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.archives-ouvertes.fr/docs/00/42/14/62/PDF/dj-sac08csp.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00421462v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00421462","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Applied Computing, 2008, Brazil. p. 140-144, &#x27E8;10.1145/1363686.1363725&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00421462v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00421462","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Applied Computing, 2008, Brazil. p. 140-144, &#x27E8;10.1145/1363686.1363725&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W36368440","https://openalex.org/W153230822","https://openalex.org/W207647324","https://openalex.org/W1504783514","https://openalex.org/W1563516866","https://openalex.org/W1589463017","https://openalex.org/W1723775608","https://openalex.org/W1988095917","https://openalex.org/W2021981218","https://openalex.org/W2022846948","https://openalex.org/W2092007705","https://openalex.org/W2113342453","https://openalex.org/W2130550049","https://openalex.org/W2166797227","https://openalex.org/W4308322258","https://openalex.org/W6606242250"],"related_works":["https://openalex.org/W1510768092","https://openalex.org/W2611003898","https://openalex.org/W2951912874","https://openalex.org/W2171997565","https://openalex.org/W2178697489","https://openalex.org/W4291370860","https://openalex.org/W2949988548","https://openalex.org/W3154160056","https://openalex.org/W2381224930","https://openalex.org/W2610525591"],"abstract_inverted_index":{"Numerical":[0],"constraint":[1,101],"solving":[2,120],"techniques":[3,13],"operate":[4],"in":[5,34,103],"a":[6,35,53],"branch&amp;amp;":[7],"prune":[8,15],"fashion,":[9],"using":[10],"consistency":[11,69],"enforcement":[12],"to":[14,22,70,79,105],"the":[16,42,46,66,80,88,95,107,110,128],"search":[17],"space":[18],"and":[19,38],"splitting":[20,81,91,130],"operations":[21],"explore":[23,87],"it.":[24],"Extensions":[25],"address":[26],"disjunctions":[27],"of":[28,68,90,98],"constraints":[29],"as":[30],"well,":[31],"but":[32,73],"usually":[33],"restrictive":[36],"case":[37],"not":[39],"fitting":[40],"well":[41],"branch&amp;amp;prune":[43],"scheme.":[44],"On":[45],"other":[47],"hand,":[48],"Ratschan":[49],"has":[50],"recently":[51],"proposed":[52],"general":[54],"framework":[55],"for":[56],"first-order":[57],"formu-las":[58],"whose":[59],"atoms":[60],"are":[61],"numerical":[62,100],"constraints.":[63],"It":[64],"extends":[65],"notion":[67],"logical":[71,96],"terms,":[72],"little":[74],"is":[75],"done":[76],"with":[77],"respect":[78],"operation.":[82],"In":[83],"this":[84],"paper,":[85],"we":[86],"potential":[89],"heuristics":[92],"that":[93,118],"exploit":[94],"structure":[97],"disjunctive":[99],"problems":[102],"or-der":[104],"simplify":[106],"problem":[108],"along":[109],"search.":[111],"First":[112],"experi-ments":[113],"on":[114],"CNF":[115],"formulas":[116],"show":[117],"interesting":[119],"time":[121],"gains":[122],"can":[123],"be":[124],"achieved":[125],"by":[126],"choosing":[127],"right":[129],"points.":[131]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
