{"id":"https://openalex.org/W2002228032","doi":"https://doi.org/10.1016/s1571-0661(04)00154-9","title":"On the Number of Rule Applications in Constraint Programs","display_name":"On the Number of Rule Applications in Constraint Programs","publication_year":2001,"publication_date":"2001-06-01","ids":{"openalex":"https://openalex.org/W2002228032","doi":"https://doi.org/10.1016/s1571-0661(04)00154-9","mag":"2002228032"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)00154-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00154-9","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)00154-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032517478","display_name":"Thom Fr\u00fchwirth","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thom Fr\u00fchwirth","raw_affiliation_strings":["Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Institut f\u00fcr Informatik, Oettingenstrasse 67, D-80538 Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Institut f\u00fcr Informatik, Oettingenstrasse 67, D-80538 Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032517478"],"corresponding_institution_ids":["https://openalex.org/I8204097"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.17111757,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":null,"first_page":"147","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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.9997000098228455,"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.9909999966621399,"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/T11106","display_name":"Data Management and Algorithms","score":0.9835000038146973,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.64445960521698},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.6309570074081421},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.6094179153442383},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.550559937953949},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5417892932891846},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5378100275993347},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.526084303855896},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48518139123916626},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4341449737548828},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43118417263031006},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4022715091705322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.379167377948761},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3482147455215454},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2990570068359375},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29001283645629883},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20252946019172668},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.09213373064994812},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07198446989059448}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.64445960521698},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.6309570074081421},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.6094179153442383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.550559937953949},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5417892932891846},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5378100275993347},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.526084303855896},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48518139123916626},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4341449737548828},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43118417263031006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4022715091705322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.379167377948761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3482147455215454},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2990570068359375},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29001283645629883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20252946019172668},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.09213373064994812},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07198446989059448},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(04)00154-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00154-9","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"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)00154-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00154-9","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W118218853","https://openalex.org/W134890678","https://openalex.org/W1499633535","https://openalex.org/W1508534709","https://openalex.org/W1550809368","https://openalex.org/W1558482861","https://openalex.org/W1566707600","https://openalex.org/W1584569710","https://openalex.org/W1589232796","https://openalex.org/W1705654268","https://openalex.org/W1976066707","https://openalex.org/W2063727779","https://openalex.org/W2069683773","https://openalex.org/W2079333278","https://openalex.org/W2089328546","https://openalex.org/W2112957923","https://openalex.org/W2138037655","https://openalex.org/W2501430986","https://openalex.org/W2912248191","https://openalex.org/W4255250986","https://openalex.org/W4285719527","https://openalex.org/W6630369525","https://openalex.org/W6633495337"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W1531664660","https://openalex.org/W2032348095","https://openalex.org/W2049055139","https://openalex.org/W2140769824","https://openalex.org/W115413730","https://openalex.org/W2524435840","https://openalex.org/W2520084020","https://openalex.org/W2156897434"],"abstract_inverted_index":{"We":[0,53],"predict":[1],"the":[2,21,50],"maximal":[3],"number":[4],"of":[5,12,34],"rule":[6],"applications,":[7],"i.e.":[8],"worst-case":[9],"derivation":[10,39],"lengths":[11,40],"computations,":[13],"in":[14,20,46,57],"rule-based":[15],"constraint":[16,29,86],"solver":[17],"programs":[18],"written":[19],"CHR":[22,24],"language.":[23],"are":[25,41,54],"a":[26,62],"committed-choice":[27],"concurrent":[28],"logic":[30],"programming":[31],"language":[32],"consisting":[33],"multi-headed":[35],"guarded":[36],"rules.":[37],"The":[38],"derived":[42],"from":[43,89],"rankings":[44,58,69],"used":[45],"termination":[47],"proofs":[48],"for":[49],"respective":[51],"programs.":[52],"especially":[55],"interested":[56],"that":[59],"give":[60],"us":[61],"good":[63],"upper":[64],"bound,":[65],"we":[66,77],"call":[67],"such":[68],"tight.":[70],"Based":[71],"on":[72],"test-runs":[73],"with":[74,81],"randomized":[75],"data,":[76],"compare":[78],"our":[79],"predictions":[80],"empirical":[82],"results":[83],"by":[84],"considering":[85],"solvers":[87],"ranging":[88],"Boolean":[90],"and":[91,96],"terminological":[92],"constraints":[93],"to":[94],"arc-consistency":[95],"path-consistency.":[97]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}