{"id":"https://openalex.org/W2096485306","doi":"https://doi.org/10.1016/s1571-0661(04)80675-3","title":"Deductive Generation of Constraint Propagation Rules","display_name":"Deductive Generation of Constraint Propagation Rules","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W2096485306","doi":"https://doi.org/10.1016/s1571-0661(04)80675-3","mag":"2096485306"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80675-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80675-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80675-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016297190","display_name":"Sebastian Brand","orcid":"https://orcid.org/0000-0003-2278-2042"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Sebastian Brand","raw_affiliation_strings":["CWI P.O. Box 94079, 1090 GB Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CWI P.O. Box 94079, 1090 GB Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027575859","display_name":"\u00c9ric Monfroy","orcid":"https://orcid.org/0000-0001-7970-1368"},"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":"Eric Monfroy","raw_affiliation_strings":["IRIN Universit\u00e9 de Nantes, 2, rue de la Houssini\u00e8re, BP 92208 Nantes Cedex, 03, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIN Universit\u00e9 de Nantes, 2, rue de la Houssini\u00e8re, BP 92208 Nantes Cedex, 03, France","institution_ids":["https://openalex.org/I97188460"]}]}],"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":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.17925048,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"86","issue":"2","first_page":"45","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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.9995999932289124,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9907000064849854,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.7569570541381836},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6322767734527588},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.6150882840156555},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5849165916442871},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5386303663253784},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5318441390991211},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5253716707229614},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5115864872932434},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5053752064704895},{"id":"https://openalex.org/keywords/conjunction","display_name":"Conjunction (astronomy)","score":0.46717578172683716},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4487449824810028},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4375345706939697},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3361005485057831},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3203566372394562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2861250638961792},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1805502474308014}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7569570541381836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6322767734527588},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.6150882840156555},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5849165916442871},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5386303663253784},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5318441390991211},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5253716707229614},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5115864872932434},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5053752064704895},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.46717578172683716},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4487449824810028},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4375345706939697},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3361005485057831},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3203566372394562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2861250638961792},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1805502474308014},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s1571-0661(04)80675-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80675-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/272b2f7e-83fd-42d0-95d3-05b2b3b14f1c","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/deductive-generation-of-constraint-propagation-rules(272b2f7e-83fd-42d0-95d3-05b2b3b14f1c).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brand, S & Monfroy, E 2003, 'Deductive Generation of Constraint Propagation Rules', Electronic Notes in Theoretical Computer Science, vol. 86, no. 2.","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/272b2f7e-83fd-42d0-95d3-05b2b3b14f1c","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/deductive-generation-of-constraint-propagation-rules(272b2f7e-83fd-42d0-95d3-05b2b3b14f1c).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Notes in Theoretical Computer Science, 86(2). Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80675-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80675-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W852874","https://openalex.org/W77870502","https://openalex.org/W1491971978","https://openalex.org/W1526246833","https://openalex.org/W1533315542","https://openalex.org/W1536327987","https://openalex.org/W1546979268","https://openalex.org/W1564110513","https://openalex.org/W1567388431","https://openalex.org/W1573314693","https://openalex.org/W1591345550","https://openalex.org/W1688043115","https://openalex.org/W1855329006","https://openalex.org/W1909509671","https://openalex.org/W2079333278","https://openalex.org/W2129403491","https://openalex.org/W2132046336","https://openalex.org/W2153621541","https://openalex.org/W2327696470","https://openalex.org/W4301885396"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W96881443","https://openalex.org/W2140769824","https://openalex.org/W2141935412","https://openalex.org/W2784687883","https://openalex.org/W1544601823","https://openalex.org/W2032348095"],"abstract_inverted_index":{"Constraint":[0],"propagation":[1],"can":[2],"often":[3],"be":[4],"conveniently":[5],"expressed":[6],"by":[7],"rules.":[8],"In":[9],"recent":[10],"years,":[11],"a":[12,30,35,46,51],"number":[13],"of":[14,19,27,48,73],"techniques":[15],"for":[16,50,62,70],"automatic":[17],"generation":[18,36],"rule-based":[20],"constraint":[21,53,74],"solvers":[22,61],"have":[23],"been":[24],"developed,":[25],"most":[26],"them":[28],"using":[29],"generate-and-test":[31],"approach.":[32],"We":[33,65],"examine":[34],"method":[37],"that":[38],"is":[39,54],"based":[40],"on":[41],"deduction.":[42],"A":[43],"solver":[44,68],"(i.e.":[45],"set":[47],"rules)":[49],"complex":[52],"obtained":[55],"from":[56],"one":[57],"or":[58],"several":[59,71],"weaker":[60],"simple":[63],"constraints.":[64],"describe":[66],"incremental":[67],"constructions":[69],"types":[72],"modifications,":[75],"including":[76],"conjunction,":[77],"existential":[78],"and":[79],"universal":[80],"quantification.":[81]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}