{"id":"https://openalex.org/W3213037164","doi":"https://doi.org/10.1017/s1471068421000491","title":"Tackling the DM Challenges with cDMN: A Tight Integration of DMN and Constraint Reasoning","display_name":"Tackling the DM Challenges with cDMN: A Tight Integration of DMN and Constraint Reasoning","publication_year":2021,"publication_date":"2021-11-12","ids":{"openalex":"https://openalex.org/W3213037164","doi":"https://doi.org/10.1017/s1471068421000491","mag":"3213037164"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068421000491","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068421000491","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/bitstream/123456789/673987/4/TPLP_cdmn_Vandevelde_Aerts_Vennekens.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002566426","display_name":"Simon Vandevelde","orcid":"https://orcid.org/0000-0001-7312-3675"},"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":false,"raw_author_name":"SIMON VANDEVELDE","raw_affiliation_strings":["KU Leuven, De Nayer Campus, Department of Computer Science J.-P. De Nayerlaan 5, 2860 Sint-Katelijne-Waver, Belgium Leuven.AI - KU Leuven Institute for AI, B-3000 Leuven, Belgium (e-mails:"],"raw_orcid":"https://orcid.org/0000-0001-7312-3675","affiliations":[{"raw_affiliation_string":"KU Leuven, De Nayer Campus, Department of Computer Science J.-P. De Nayerlaan 5, 2860 Sint-Katelijne-Waver, Belgium Leuven.AI - KU Leuven Institute for AI, B-3000 Leuven, Belgium (e-mails:","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025103675","display_name":"Bram Aerts","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":false,"raw_author_name":"BRAM AERTS","raw_affiliation_strings":["KU Leuven, De Nayer Campus, Department of Computer Science J.-P. De Nayerlaan 5, 2860 Sint-Katelijne-Waver, Belgium Leuven.AI - KU Leuven Institute for AI, B-3000 Leuven, Belgium (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven, De Nayer Campus, Department of Computer Science J.-P. De Nayerlaan 5, 2860 Sint-Katelijne-Waver, Belgium Leuven.AI - KU Leuven Institute for AI, B-3000 Leuven, Belgium (e-mails:","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071976409","display_name":"Joost Vennekens","orcid":"https://orcid.org/0000-0002-0791-0176"},"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":false,"raw_author_name":"JOOST VENNEKENS","raw_affiliation_strings":["KU Leuven, De Nayer Campus, Department of Computer Science J.-P. De Nayerlaan 5, 2860 Sint-Katelijne-Waver, Belgium Leuven.AI - KU Leuven Institute for AI, B-3000 Leuven, Belgium (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven, De Nayer Campus, Department of Computer Science J.-P. De Nayerlaan 5, 2860 Sint-Katelijne-Waver, Belgium Leuven.AI - KU Leuven Institute for AI, B-3000 Leuven, Belgium (e-mails:","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6997,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77044623,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"23","issue":"3","first_page":"535","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.998199999332428,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9980999827384949,"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/T10906","display_name":"AI-based Problem Solving and Planning","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.7949376702308655},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.7911416292190552},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.6815022230148315},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5956728458404541},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5676426291465759},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.531705915927887},{"id":"https://openalex.org/keywords/domain-knowledge","display_name":"Domain knowledge","score":0.4771135151386261},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4342387318611145},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.36675938963890076},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3609499931335449},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34560829401016235},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1671704649925232},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09794104099273682}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7949376702308655},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.7911416292190552},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.6815022230148315},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5956728458404541},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5676426291465759},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.531705915927887},{"id":"https://openalex.org/C207685749","wikidata":"https://www.wikidata.org/wiki/Q2088941","display_name":"Domain knowledge","level":2,"score":0.4771135151386261},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4342387318611145},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.36675938963890076},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3609499931335449},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34560829401016235},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1671704649925232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09794104099273682},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068421000491","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068421000491","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/673987","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/bitstream/123456789/673987/4/TPLP_cdmn_Vandevelde_Aerts_Vennekens.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory And Practice Of Logic Programming, Art.No. PII S1471068421000491, (1-24)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/673987","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/bitstream/123456789/673987/4/TPLP_cdmn_Vandevelde_Aerts_Vennekens.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory And Practice Of Logic Programming, Art.No. PII S1471068421000491, (1-24)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1757790192","https://openalex.org/W2036981717","https://openalex.org/W2294394684","https://openalex.org/W2520571003","https://openalex.org/W2779529017","https://openalex.org/W2794856943","https://openalex.org/W2884627861","https://openalex.org/W2913331658","https://openalex.org/W2963543760","https://openalex.org/W2963870233","https://openalex.org/W2972655304","https://openalex.org/W2981400010","https://openalex.org/W2991582590","https://openalex.org/W2995764556","https://openalex.org/W3082513714","https://openalex.org/W3089256861","https://openalex.org/W3105012855","https://openalex.org/W6771108471","https://openalex.org/W6771934945","https://openalex.org/W7011599819"],"related_works":["https://openalex.org/W2366107444","https://openalex.org/W4388145910","https://openalex.org/W2381570729","https://openalex.org/W1976205134","https://openalex.org/W4248336175","https://openalex.org/W2031260042","https://openalex.org/W2391445434","https://openalex.org/W2504004674","https://openalex.org/W3009369890","https://openalex.org/W4312490297"],"abstract_inverted_index":{"Abstract":[0],"Knowledge-based":[1],"AI":[2],"typically":[3],"depends":[4],"on":[5,107],"a":[6,11,49],"knowledge":[7,16],"engineer":[8],"to":[9,32,60,73,81,118,125,139],"construct":[10],"formal":[12],"model":[13,61,82],"of":[14,68,77,91],"domain":[15,21,58,85,95],"\u2013":[17],"but":[18],"what":[19],"if":[20],"experts":[22,59],"could":[23],"do":[24],"this":[25],"themselves?":[26],"This":[27],"paper":[28],"describes":[29],"an":[30],"extension":[31],"the":[33,66,75,102,108,119,126],"Decision":[34,42],"Model":[35,43],"and":[36,44,128],"Notation":[37,45],"(DMN)":[38],"standard,":[39],"called":[40],"Constraint":[41],"(cDMN).":[46],"DMN":[47,78],"is":[48,133,137],"user-friendly,":[50],"table-based":[51],"notation":[52],"for":[53],"decision":[54,63],"logic,":[55],"which":[56],"allows":[57],"simple":[62],"procedures":[64],"without":[65],"help":[67],"IT":[69],"staff.":[70],"cDMN":[71,99,116,136],"aims":[72],"enlarge":[74],"expressiveness":[76],"in":[79],"order":[80],"more":[83,141],"complex":[84,104],"knowledge,":[86],"while":[87],"retaining":[88],"DMNs":[89],"goal":[90],"being":[92],"understandable":[93],"by":[94,100],"experts.":[96],"We":[97,112],"test":[98],"solving":[101],"most":[103],"challenges":[105,142],"posted":[106],"DM":[109],"Community":[110],"website.":[111],"compare":[113],"our":[114,131],"own":[115],"solutions":[117,120],"that":[121,130],"have":[122],"been":[123],"submitted":[124],"website":[127],"find":[129],"approach":[132],"competitive.":[134],"Moreover,":[135],"able":[138],"solve":[140],"than":[143],"any":[144],"other":[145],"approach.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}