{"id":"https://openalex.org/W2555779514","doi":"https://doi.org/10.1007/s00165-016-0396-9","title":"On proving confluence modulo equivalence for Constraint Handling Rules","display_name":"On proving confluence modulo equivalence for Constraint Handling Rules","publication_year":2016,"publication_date":"2016-11-17","ids":{"openalex":"https://openalex.org/W2555779514","doi":"https://doi.org/10.1007/s00165-016-0396-9","mag":"2555779514"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-016-0396-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-016-0396-9","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1611.03628","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Henning Christiansen","orcid":null},"institutions":[{"id":"https://openalex.org/I107707843","display_name":"Roskilde University","ror":"https://ror.org/014axpa37","country_code":"DK","type":"education","lineage":["https://openalex.org/I107707843"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Henning Christiansen","raw_affiliation_strings":["Research group PLIS: Programming, Logic and Intelligent Systems, Department of People and Technology, Roskilde University, Roskilde, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research group PLIS: Programming, Logic and Intelligent Systems, Department of People and Technology, Roskilde University, Roskilde, Denmark","institution_ids":["https://openalex.org/I107707843"]}]},{"author_position":"last","author":{"id":null,"display_name":"Maja H. Kirkeby","orcid":null},"institutions":[{"id":"https://openalex.org/I107707843","display_name":"Roskilde University","ror":"https://ror.org/014axpa37","country_code":"DK","type":"education","lineage":["https://openalex.org/I107707843"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Maja H. Kirkeby","raw_affiliation_strings":["Research group PLIS: Programming, Logic and Intelligent Systems, Department of People and Technology, Roskilde University, Roskilde, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research group PLIS: Programming, Logic and Intelligent Systems, Department of People and Technology, Roskilde University, Roskilde, Denmark","institution_ids":["https://openalex.org/I107707843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0681,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88959868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"29","issue":"1","first_page":"57","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5766000151634216,"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.5766000151634216,"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/T10126","display_name":"Logic, programming, and type systems","score":0.2084999978542328,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.09099999815225601,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.8698999881744385},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.784500002861023},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6416000127792358},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6003999710083008},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.574400007724762},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.5030999779701233},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.4821999967098236},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4212000072002411},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4133000075817108}],"concepts":[{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.8698999881744385},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.784500002861023},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6416000127792358},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6003999710083008},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.574400007724762},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.5030999779701233},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.4821999967098236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47279998660087585},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4212000072002411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4171999990940094},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4088999927043915},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4025000035762787},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3952000141143799},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39160001277923584},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.37119999527931213},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.3206000030040741},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.31459999084472656},{"id":"https://openalex.org/C2777044963","wikidata":"https://www.wikidata.org/wiki/Q5384707","display_name":"Equivalence class (music)","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C61151141","wikidata":"https://www.wikidata.org/wiki/Q7249983","display_name":"Proof-theoretic semantics","level":5,"score":0.2969000041484833},{"id":"https://openalex.org/C146499914","wikidata":"https://www.wikidata.org/wiki/Q5469969","display_name":"Formal semantics (linguistics)","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2653999924659729},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.25839999318122864}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00165-016-0396-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-016-0396-9","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1611.03628","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1611.03628","pdf_url":"https://arxiv.org/pdf/1611.03628","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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:pure.atira.dk:openaire/6136f6ae-d333-45a4-a733-6e71379987ad","is_oa":true,"landing_page_url":"https://forskning.ruc.dk/da/publications/6136f6ae-d333-45a4-a733-6e71379987ad","pdf_url":"https://arxiv.org/pdf/1611.03628.pdf","source":{"id":"https://openalex.org/S4306401457","display_name":"RUCforsk (Roskilde University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I107707843","host_organization_name":"Roskilde University","host_organization_lineage":["https://openalex.org/I107707843"],"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":"Christiansen, H & Kirkeby, M H 2017, 'On proving confluence modulo equivalence for Constraint Handling Rules', Formal Aspects of Computing, vol. 29, no. 1, pp. 57-95. https://doi.org/10.1007/s00165-016-0396-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/6136f6ae-d333-45a4-a733-6e71379987ad","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1611.03628","pdf_url":null,"source":{"id":"https://openalex.org/S4306401457","display_name":"RUCforsk (Roskilde University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I107707843","host_organization_name":"Roskilde University","host_organization_lineage":["https://openalex.org/I107707843"],"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":"Christiansen, H & Kirkeby, M H 2017, 'On proving confluence modulo equivalence for Constraint Handling Rules', Formal Aspects of Computing, vol. 29, no. 1, pp. 57-95. https://doi.org/10.1007/s00165-016-0396-9","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1611.03628","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1611.03628","pdf_url":"https://arxiv.org/pdf/1611.03628","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1483111029","https://openalex.org/W1494472157","https://openalex.org/W1498867194","https://openalex.org/W1499633535","https://openalex.org/W1504983647","https://openalex.org/W1513409503","https://openalex.org/W1556786566","https://openalex.org/W1605034197","https://openalex.org/W1975808446","https://openalex.org/W1979101142","https://openalex.org/W1988103858","https://openalex.org/W1991133427","https://openalex.org/W2033278487","https://openalex.org/W2044146725","https://openalex.org/W2079333278","https://openalex.org/W2107415004","https://openalex.org/W2123830440","https://openalex.org/W2170551989","https://openalex.org/W2171783042","https://openalex.org/W2274183736","https://openalex.org/W2323378191","https://openalex.org/W2507006525","https://openalex.org/W2507030198","https://openalex.org/W2570710533","https://openalex.org/W2911319454","https://openalex.org/W3157198933","https://openalex.org/W4234159174"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Previous":[1],"results":[2],"on":[3,111],"proving":[4],"confluence":[5,39,48,68],"for":[6,49,58,86,120,149,222,232],"Constraint":[7],"Handling":[8],"Rules":[9],"are":[10,106],"extended":[11],"in":[12,15,108,165,174],"two":[13],"ways":[14],"order":[16],"to":[17,28,62,76,81,218],"allow":[18,92],"a":[19,50,59,116,181,210,219],"larger":[20],"and":[21,99,143,190,199],"more":[22],"realistic":[23],"class":[24],"of":[25,38,45,141,152,159,213],"CHR":[26,121],"programs":[27],"be":[29,77,147,163],"considered":[30],"confluent.":[31],"Firstly,":[32],"we":[33,91,169],"introduce":[34],"the":[35,43,63,73,87,155,175,197,246],"relaxed":[36],"notion":[37],"modulo":[40,69],"equivalence":[41,70,83],"into":[42],"context":[44],"CHR:":[46],"while":[47],"terminating":[51],"program":[52],"means":[53],"that":[54,105,168,184,195],"all":[55],"alternative":[56],"derivations":[57,191],"query":[60],"lead":[61],"exact":[64],"same":[65],"final":[66,74],"state,":[67],"only":[71],"requires":[72],"states":[75,189],"equivalent":[78],"with":[79,192],"respect":[80],"an":[82],"relation":[84],"tailored":[85],"given":[88],"program.":[89],"Secondly,":[90],"non-logical":[93,198],"built-in":[94],"predicates":[95],"such":[96,102,126,223],"as":[97,103,206],"var/1":[98],"incomplete":[100,200],"ones":[101],"is/2,":[104],"ignored":[107],"previous":[109],"work":[110],"confluence.":[112],"To":[113],"this":[114,130],"end,":[115],"new":[117],"operational":[118],"semantics":[119,131],"is":[122,171,227],"developed":[123],"which":[124,208],"includes":[125],"predicates.":[127,201],"In":[128],"addition,":[129],"differs":[132],"from":[133,245],"earlier":[134],"approaches":[135],"by":[136,229],"its":[137],"simplicity":[138],"without":[139],"loss":[140],"generality,":[142],"it":[144],"may":[145],"also":[146],"recommended":[148],"future":[150],"studies":[151],"CHR.":[153],"For":[154],"purely":[156],"logical":[157],"subset":[158],"CHR,":[160],"proofs":[161],"can":[162],"expressed":[164],"first-order":[166],"logic,":[167],"show":[170],"not":[172],"sufficient":[173],"present":[176],"case.":[177],"We":[178],"have":[179],"introduced":[180],"formal":[182],"meta-language":[183],"allows":[185],"reasoning":[186],"about":[187],"abstract":[188],"meta-level":[193],"restrictions":[194],"reflect":[196],"This":[202],"language":[203],"represents":[204],"subproofs":[205],"diagrams,":[207],"facilitates":[209],"systematic":[211],"enumeration":[212],"proof":[214],"cases,":[215],"pointing":[216],"forward":[217],"mechanical":[220],"support":[221],"proofs.":[224],"The":[225,230,239],"Project":[226],"supported":[228],"DanishCouncil":[231],"IndependentResearch,":[233],"Natural":[234],"Sciences,":[235],"Grant":[236,254],"No.":[237,256],"DFF4181-00442.":[238],"second":[240],"author\u2019s":[241],"contribution":[242],"received":[243],"funding":[244],"European":[247],"Union":[248],"Seventh":[249],"Framework":[250],"Programme":[251],"(FP7/2007-2013)":[252],"under":[253],"Agreement":[255],"318337,":[257],"ENTRA\u2014Whole-Systems":[258],"Energy":[259],"Transparency.":[260]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-11-30T00:00:00"}