{"id":"https://openalex.org/W2769306164","doi":"https://doi.org/10.1145/3143804","title":"Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols","display_name":"Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols","publication_year":2017,"publication_date":"2017-10-31","ids":{"openalex":"https://openalex.org/W2769306164","doi":"https://doi.org/10.1145/3143804","mag":"2769306164"},"language":"en","primary_location":{"id":"doi:10.1145/3143804","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3143804","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/cf7026a9-bac8-4ba0-b9a7-6ccfaebbc826","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066005299","display_name":"Marco Calautti","orcid":"https://orcid.org/0000-0003-0921-4040"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Marco Calautti","raw_affiliation_strings":["University of Edinburgh, Scotland, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Scotland, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031964906","display_name":"Sergio Greco","orcid":"https://orcid.org/0000-0003-2966-3484"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Sergio Greco","raw_affiliation_strings":["DIMES, Universit\u00e0 della Calabria, Italy"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067924380","display_name":"Irina Trubitsyna","orcid":"https://orcid.org/0000-0002-9031-0672"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Irina Trubitsyna","raw_affiliation_strings":["DIMES, Universit\u00e0 della Calabria, Italy"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066005299"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.6231,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78015554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":"4","first_page":"1","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9991000294685364,"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/decidability","display_name":"Decidability","score":0.9039801359176636},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.8220945596694946},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5877323746681213},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5857312083244324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5415760278701782},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5198548436164856},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4870948791503906},{"id":"https://openalex.org/keywords/normalization-property","display_name":"Normalization property","score":0.47842198610305786},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.4511524736881256},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.44906631112098694},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4354189932346344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4297775626182556},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34726035594940186},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.32559633255004883},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15827560424804688}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9039801359176636},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8220945596694946},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5877323746681213},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5857312083244324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5415760278701782},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5198548436164856},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4870948791503906},{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.47842198610305786},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.4511524736881256},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44906631112098694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4354189932346344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4297775626182556},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34726035594940186},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.32559633255004883},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15827560424804688},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3143804","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3143804","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/cf7026a9-bac8-4ba0-b9a7-6ccfaebbc826","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/cf7026a9-bac8-4ba0-b9a7-6ccfaebbc826","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Calautti, M, Greco, S & Trubitsyna, I 2017, 'Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols', ACM Transactions on Computational Logic, vol. 18, no. 4, pp. 28:1-28:42. https://doi.org/10.1145/3143804","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:air.unimi.it:2434/953307","is_oa":true,"landing_page_url":"https://hdl.handle.net/2434/953307","pdf_url":null,"source":{"id":"https://openalex.org/S4306400516","display_name":"Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189158943","host_organization_name":"University of Milan","host_organization_lineage":["https://openalex.org/I189158943"],"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":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.unitn.it:11572/260179","is_oa":false,"landing_page_url":"http://hdl.handle.net/11572/260179","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"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":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/cf7026a9-bac8-4ba0-b9a7-6ccfaebbc826","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/detecting-decidable-classes-of-finitely-ground-logic-programs-with-function-symbols(cf7026a9-bac8-4ba0-b9a7-6ccfaebbc826).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Calautti, M, Greco, S & Trubitsyna, I 2017, 'Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols', ACM Transactions on Computational Logic, vol. 18, no. 4, pp. 28:1-28:42. https://doi.org/10.1145/3143804","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/cf7026a9-bac8-4ba0-b9a7-6ccfaebbc826","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/cf7026a9-bac8-4ba0-b9a7-6ccfaebbc826","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Calautti, M, Greco, S & Trubitsyna, I 2017, 'Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols', ACM Transactions on Computational Logic, vol. 18, no. 4, pp. 28:1-28:42. https://doi.org/10.1145/3143804","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W74127607","https://openalex.org/W300076026","https://openalex.org/W649907208","https://openalex.org/W1484110122","https://openalex.org/W1488953560","https://openalex.org/W1489930498","https://openalex.org/W1552168992","https://openalex.org/W1574704561","https://openalex.org/W1579524364","https://openalex.org/W1590284853","https://openalex.org/W1599833144","https://openalex.org/W1672891595","https://openalex.org/W1821679657","https://openalex.org/W1824207140","https://openalex.org/W1875104636","https://openalex.org/W1965483956","https://openalex.org/W1968513265","https://openalex.org/W1996865163","https://openalex.org/W2003227046","https://openalex.org/W2009286786","https://openalex.org/W2013096722","https://openalex.org/W2028222220","https://openalex.org/W2029399717","https://openalex.org/W2035910535","https://openalex.org/W2038040550","https://openalex.org/W2050480346","https://openalex.org/W2051564255","https://openalex.org/W2057035741","https://openalex.org/W2057069578","https://openalex.org/W2066734765","https://openalex.org/W2070546615","https://openalex.org/W2076698873","https://openalex.org/W2080461902","https://openalex.org/W2083882369","https://openalex.org/W2085386651","https://openalex.org/W2102729564","https://openalex.org/W2111739714","https://openalex.org/W2115215132","https://openalex.org/W2119843185","https://openalex.org/W2124061668","https://openalex.org/W2128219525","https://openalex.org/W2135520900","https://openalex.org/W2135819447","https://openalex.org/W2137327104","https://openalex.org/W2151672741","https://openalex.org/W2171987376","https://openalex.org/W2202863966","https://openalex.org/W2235059062","https://openalex.org/W2261579031","https://openalex.org/W2284989774","https://openalex.org/W2340222647","https://openalex.org/W2561675875","https://openalex.org/W2596962069","https://openalex.org/W2615497679","https://openalex.org/W2786353107","https://openalex.org/W3023186102","https://openalex.org/W3045954188","https://openalex.org/W3099640838","https://openalex.org/W3102313542","https://openalex.org/W3104540610","https://openalex.org/W3104721040","https://openalex.org/W4298437779"],"related_works":["https://openalex.org/W2187310579","https://openalex.org/W1517932751","https://openalex.org/W1545660605","https://openalex.org/W2401586919","https://openalex.org/W1965531865","https://openalex.org/W3033862888","https://openalex.org/W3080160234","https://openalex.org/W4287765525","https://openalex.org/W4294290144","https://openalex.org/W2115335123"],"abstract_inverted_index":{"In":[0],"this":[1,114],"article,":[2],"we":[3,53],"propose":[4],"a":[5,57,110,123,160,170],"new":[6],"technique":[7,22,168],"for":[8],"checking":[9,121],"whether":[10],"the":[11,26,47,84,106,130,133,144,152,198,206],"bottom-up":[12,48,85,207],"evaluation":[13],"of":[14,28,34,59,73,89,120,132,151,163,200],"logic":[15,112,164],"programs":[16,178,201],"with":[17,192],"function":[18,35],"symbols":[19],"terminates.":[20],"The":[21,166],"is":[23,125,156],"based":[24],"on":[25],"definition":[27],"mappings":[29,100],"from":[30,51,67,94],"arguments":[31,45,63,76,91],"to":[32,117,139,158,195],"strings":[33],"symbols,":[36],"representing":[37],"possible":[38],"values":[39,66,93],"which":[40],"could":[41],"be":[42,102,190],"taken":[43],"by":[44,104,181],"during":[46],"evaluation.":[49,208],"Starting":[50],"mappings,":[52],"identify":[54],"mapping-restricted":[55],"arguments,":[56,61],"subset":[58],"limited":[60],"namely":[62],"that":[64,99,155],"take":[65,92],"finite":[68,95],"domains.":[69,96],"Mapping-restricted":[70],"programs,":[71],"consisting":[72],"rules":[74],"whose":[75],"are":[77,81],"all":[78,88],"mapping":[79,126],"restricted,":[80],"terminating":[82,177,204],"under":[83,205],"computation,":[86],"as":[87,173,203],"its":[90],"We":[97,128,146],"show":[98],"can":[101,175,189],"computed":[103],"transforming":[105],"original":[107],"program":[108,124],"into":[109],"unary":[111],"program:":[113],"allows":[115],"us":[116],"establish":[118],"decidability":[119],"if":[122],"restricted.":[127],"study":[129],"complexity":[131],"presented":[134,167],"approach":[135,154],"and":[136],"compare":[137],"it":[138,174,188],"other":[140,182,193],"techniques":[141,194],"known":[142],"in":[143],"literature.":[145],"also":[147],"introduce":[148],"an":[149],"extension":[150],"proposed":[153,184],"able":[157],"recognize":[159],"wider":[161],"class":[162,199],"programs.":[165],"provides":[169],"significant":[171],"improvement,":[172],"detect":[176],"not":[179],"identified":[180],"criteria":[183],"so":[185],"far.":[186],"Furthermore,":[187],"combined":[191],"further":[196],"enlarge":[197],"recognized":[202]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}