{"id":"https://openalex.org/W2790800925","doi":"https://doi.org/10.1017/s1471068418000030","title":"Tree dimension in verification of constrained Horn clauses","display_name":"Tree dimension in verification of constrained Horn clauses","publication_year":2018,"publication_date":"2018-03-01","ids":{"openalex":"https://openalex.org/W2790800925","doi":"https://doi.org/10.1017/s1471068418000030","mag":"2790800925"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068418000030","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068418000030","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1803.01448","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031939019","display_name":"Bishoksan Kafle","orcid":"https://orcid.org/0000-0001-5191-1216"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"BISHOKSAN KAFLE","raw_affiliation_strings":["School of Computing and Information Systems, The University of Melbourne, Melbourne, Victoria, Australia (e-mail:","The University of Melbourne,"],"affiliations":[{"raw_affiliation_string":"School of Computing and Information Systems, The University of Melbourne, Melbourne, Victoria, Australia (e-mail:","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"The University of Melbourne,","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020698393","display_name":"John P. Gallagher","orcid":"https://orcid.org/0000-0001-6984-7419"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"JOHN P. GALLAGHER","raw_affiliation_strings":["Department of People and Technology, Roskilde University, Roskilde, Denmark, and IMDEA Software Institute, Pozuelo de Alarc\u00f3n, Madrid, Spain, IMDEA Software Institute (e-mail:","Programmering, logik og intelligente systemer"],"affiliations":[{"raw_affiliation_string":"Department of People and Technology, Roskilde University, Roskilde, Denmark, and IMDEA Software Institute, Pozuelo de Alarc\u00f3n, Madrid, Spain, IMDEA Software Institute (e-mail:","institution_ids":["https://openalex.org/I4210162154"]},{"raw_affiliation_string":"Programmering, logik og intelligente systemer","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106696065","display_name":"Pierre Ganty","orcid":null},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"PIERRE GANTY","raw_affiliation_strings":["IMDEA Software Institute, Pozuelo de Alarc\u00f3n, Madrid, Spain (e-mail:","IMDEA Software Institute#TAB#"],"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute, Pozuelo de Alarc\u00f3n, Madrid, Spain (e-mail:","institution_ids":["https://openalex.org/I4210162154"]},{"raw_affiliation_string":"IMDEA Software Institute#TAB#","institution_ids":["https://openalex.org/I4210162154"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031939019"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02439128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"2","first_page":"224","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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.9990000128746033,"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/T10126","display_name":"Logic, programming, and type systems","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/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.7832378149032593},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7166157960891724},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.6037351489067078},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5484512448310852},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4881616234779358},{"id":"https://openalex.org/keywords/dimension-theory","display_name":"Dimension theory (algebra)","score":0.47692200541496277},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47360873222351074},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4435943067073822},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.41873592138290405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.378665953874588},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.298989862203598},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20134615898132324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19491392374038696},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08858370780944824},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0732467770576477}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7832378149032593},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7166157960891724},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.6037351489067078},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5484512448310852},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4881616234779358},{"id":"https://openalex.org/C95341145","wikidata":"https://www.wikidata.org/wiki/Q5277265","display_name":"Dimension theory (algebra)","level":3,"score":0.47692200541496277},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47360873222351074},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4435943067073822},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.41873592138290405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.378665953874588},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.298989862203598},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20134615898132324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19491392374038696},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08858370780944824},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0732467770576477},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1017/s1471068418000030","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068418000030","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:arXiv.org:1803.01448","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.01448","pdf_url":"https://arxiv.org/pdf/1803.01448","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":"","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire/1a32a77d-2f92-4288-b037-a7e4e429d677","is_oa":true,"landing_page_url":"https://forskning.ruc.dk/da/publications/1a32a77d-2f92-4288-b037-a7e4e429d677","pdf_url":"https://arxiv.org/pdf/1803.01448","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":"Kafle, B, Gallagher, J P & Ganty, P 2018, 'Tree dimension in verification of constrained Horn clauses', Theory and Practice of Logic Programming, vol. 18, no. 2, pp. 224-251. https://doi.org/10.1017/S1471068418000030","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.1803.01448","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1803.01448","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2790800925","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1803.01448","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.01448","pdf_url":"https://arxiv.org/pdf/1803.01448","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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1936523210","display_name":null,"funder_award_id":"S2013","funder_id":"https://openalex.org/F4320321837","funder_display_name":"Ministerio de Econom\u00eda y Competitividad"},{"id":"https://openalex.org/G4531677044","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320321837","funder_display_name":"Ministerio de Econom\u00eda y Competitividad"}],"funders":[{"id":"https://openalex.org/F4320321837","display_name":"Ministerio de Econom\u00eda y Competitividad","ror":"https://ror.org/034900433"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W72241736","https://openalex.org/W74317754","https://openalex.org/W81626549","https://openalex.org/W138648951","https://openalex.org/W577336618","https://openalex.org/W1128447031","https://openalex.org/W1140939754","https://openalex.org/W1492471923","https://openalex.org/W1569188499","https://openalex.org/W1580450019","https://openalex.org/W1814221162","https://openalex.org/W1841626152","https://openalex.org/W2048831705","https://openalex.org/W2062873592","https://openalex.org/W2122599614","https://openalex.org/W2132872141","https://openalex.org/W2139929430","https://openalex.org/W2142044962","https://openalex.org/W2149907859","https://openalex.org/W2158493209","https://openalex.org/W2168377292","https://openalex.org/W2188508418","https://openalex.org/W2192877587","https://openalex.org/W2280666326","https://openalex.org/W2282000937","https://openalex.org/W2289508293","https://openalex.org/W2293098399","https://openalex.org/W2293809538","https://openalex.org/W2338346238","https://openalex.org/W2468890279","https://openalex.org/W2486022212","https://openalex.org/W2496764087","https://openalex.org/W2568973816","https://openalex.org/W2741328615","https://openalex.org/W3099891861","https://openalex.org/W3141259760","https://openalex.org/W4285719527","https://openalex.org/W4293178255"],"related_works":["https://openalex.org/W2077323669","https://openalex.org/W1675346939","https://openalex.org/W2018805361","https://openalex.org/W1494513799","https://openalex.org/W2030445287","https://openalex.org/W2255083403","https://openalex.org/W2284077888","https://openalex.org/W2531234554","https://openalex.org/W1958977473","https://openalex.org/W64299615","https://openalex.org/W1803783765","https://openalex.org/W3012269879","https://openalex.org/W2406087806","https://openalex.org/W2912403374","https://openalex.org/W1522855049","https://openalex.org/W2052427582","https://openalex.org/W2112145019","https://openalex.org/W2526861534","https://openalex.org/W2956865288","https://openalex.org/W2953078492"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,176],"paper,":[3],"we":[4,102],"show":[5,69,141],"how":[6,70,142],"the":[7,16,37,80,91,128],"notion":[8],"of":[9,18,25,32,48,59,93,98,106,112,120,127,147,175,180,188],"tree":[10,27],"dimension":[11,24,49,61,92,134,156],"can":[12],"be":[13],"used":[14],"in":[15],"verification":[17,171],"constrained":[19],"Horn":[20,42],"clauses":[21,148],"(CHCs).":[22],"The":[23,118,184],"a":[26,29,83,96,104,109,145,169],"is":[28],"numerical":[30],"measure":[31],"its":[33],"branching":[34],"complexity":[35],"and":[36,190],"concept":[38],"here":[39],"applies":[40],"to":[41,52,71,86,143,167],"clause":[43],"derivation":[44],"trees.":[45],"Derivation":[46],"trees":[47,58],"zero":[50],"correspond":[51],"derivations":[53,64,121,129,154,179],"using":[54,65,164],"linear":[55],"CHCs,":[56],"while":[57],"higher":[60],"arise":[62],"from":[63],"non-linear":[66],"CHCs.":[67],"We":[68,139,160],"instrument":[72],"CHCs":[73,99,113],"predicates":[74],"with":[75],"an":[76],"extra":[77],"argument":[78],"for":[79,122,130],"dimension,":[81],"allowing":[82],"CHC":[84,170],"verifier":[85],"reason":[87],"about":[88],"bounds":[89],"on":[90],"derivations.":[94],"Given":[95],"set":[97,111,119,146],"P":[100,107,114,123,131,150],",":[101],"define":[103],"transformation":[105],"yielding":[108],"dimension-bounded":[110],"\u2264":[115,124],"k":[116,125,137,152,158],".":[117,138,159],"consists":[126],"that":[132],"have":[133,155],"at":[135],"most":[136],"also":[140],"construct":[144],"denoted":[149],">":[151],"whose":[153],"exceeding":[157],"then":[161],"present":[162],"algorithms":[163],"these":[165],"constructions":[166],"decompose":[168],"problem.":[172],"One":[173],"variation":[174],"decomposition":[177],"considers":[178],"successively":[181],"increasing":[182],"dimension.":[183],"paper":[185],"includes":[186],"descriptions":[187],"implementations":[189],"experimental":[191],"results.":[192]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}