{"id":"https://openalex.org/W2167228784","doi":"https://doi.org/10.1017/s1471068409003664","title":"Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities","display_name":"Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities","publication_year":2009,"publication_date":"2009-02-10","ids":{"openalex":"https://openalex.org/W2167228784","doi":"https://doi.org/10.1017/s1471068409003664","mag":"2167228784"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068409003664","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068409003664","pdf_url":null,"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":null,"license_id":null,"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":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/211991","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029190934","display_name":"Leslie De Koninck","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"LESLIE DE KONINCK","raw_affiliation_strings":["Department of Computer Science, K.U.Leuven, Belgium (e-mail:","Department of Computer Science, K.U.Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, K.U.Leuven, Belgium (e-mail:","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of Computer Science, K.U.Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029190934"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":1.451,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84974778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":"2","first_page":"165","last_page":"212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"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.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.992900013923645,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9926999807357788,"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.749352753162384},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5357871055603027},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.49345794320106506},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.4774485230445862},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.45682552456855774},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4502975344657898},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4304218292236328},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4149928390979767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38524773716926575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18116766214370728}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.749352753162384},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5357871055603027},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.49345794320106506},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.4774485230445862},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45682552456855774},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4502975344657898},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4304218292236328},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4149928390979767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38524773716926575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18116766214370728},{"id":"https://openalex.org/C105580179","wikidata":"https://www.wikidata.org/wiki/Q188928","display_name":"Messenger RNA","level":3,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"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/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},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068409003664","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068409003664","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/211991","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/211991","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and practice of logic programming, vol. 9 (2), (165-212)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/211991","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/211991","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and practice of logic programming, vol. 9 (2), (165-212)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W43244340","https://openalex.org/W199254071","https://openalex.org/W209443128","https://openalex.org/W1278066199","https://openalex.org/W1488160191","https://openalex.org/W1496131527","https://openalex.org/W1498867194","https://openalex.org/W1513409503","https://openalex.org/W1521013649","https://openalex.org/W1542629157","https://openalex.org/W1566707600","https://openalex.org/W1567852657","https://openalex.org/W1572013314","https://openalex.org/W1575309677","https://openalex.org/W1584744886","https://openalex.org/W1592758934","https://openalex.org/W1872879644","https://openalex.org/W2019417713","https://openalex.org/W2073450983","https://openalex.org/W2079333278","https://openalex.org/W2084224084","https://openalex.org/W2085334140","https://openalex.org/W2114158730","https://openalex.org/W2114620814","https://openalex.org/W2116502002","https://openalex.org/W2144960539","https://openalex.org/W2151290962","https://openalex.org/W2152631562","https://openalex.org/W2374439624","https://openalex.org/W2476859540","https://openalex.org/W2520238651","https://openalex.org/W2522973746","https://openalex.org/W2523945979","https://openalex.org/W2524000776","https://openalex.org/W2524143366","https://openalex.org/W2524443994","https://openalex.org/W2612638105","https://openalex.org/W2911319454","https://openalex.org/W2913823028","https://openalex.org/W3017326420","https://openalex.org/W3138626798"],"related_works":["https://openalex.org/W2807251790","https://openalex.org/W2799406489","https://openalex.org/W2033101018","https://openalex.org/W4317939968","https://openalex.org/W2099278314","https://openalex.org/W2049792449","https://openalex.org/W2394886764","https://openalex.org/W986251431","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"investigates":[3],"the":[4,7,39,58,107,117,123,127],"relationship":[5],"between":[6],"Logical":[8,63,110,128],"Algorithms":[9,111,129],"(LA)":[10],"language":[11],"of":[12,50],"Ganzinger":[13,66],"and":[14,16,36,67,69,89,94],"McAllester":[15,68],"Constraint":[17],"Handling":[18],"Rules":[19],"(CHR).":[20],"We":[21],"present":[22],"a":[23,48,72,92],"translation":[24,108],"schema":[25],"from":[26,109],"LA":[27,43],"to":[28,47,112,132],"CHR":[29,32,51,82,99,113,119],"rp":[30,52,83,100,114,120],":":[31],"with":[33,116],"rule":[34],"priorities,":[35],"show":[37],"that":[38,84,106],"meta-complexity":[40,96,130],"theorem":[41,97],"for":[42,62,81,98,126],"can":[44],"be":[45],"applied":[46],"subset":[49],"via":[53],"inverse":[54],"translation.":[55],"Inspired":[56],"by":[57,65],"high-level":[59],"implementation":[60,80,121],"proposal":[61],"Algorithm":[64],"based":[70],"on":[71],"new":[73,93,118],"scheduling":[74],"algorithm,":[75],"we":[76],"propose":[77],"an":[78],"alternative":[79],"gives":[85],"strong":[86],"complexity":[87,125],"guarantees":[88],"results":[90],"in":[91],"accurate":[95],".":[101],"It":[102],"is":[103],"furthermore":[104],"shown":[105],"combined":[115],"satisfies":[122],"required":[124],"result":[131],"hold.":[133]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}