{"id":"https://openalex.org/W2949623342","doi":"https://doi.org/10.1017/s1471068419000036","title":"Optimizing Answer Set Computation via Heuristic-Based Decomposition","display_name":"Optimizing Answer Set Computation via Heuristic-Based Decomposition","publication_year":2019,"publication_date":"2019-02-28","ids":{"openalex":"https://openalex.org/W2949623342","doi":"https://doi.org/10.1017/s1471068419000036","mag":"2949623342"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068419000036","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000036","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1812.09718","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034672297","display_name":"Francesco Calimeri","orcid":"https://orcid.org/0000-0002-0866-0834"},"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":true,"raw_author_name":"FRANCESCO CALIMERI","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mails:","Department of Mathematics and Computer Science, University of Calabria, Rende, Italy"],"raw_orcid":"https://orcid.org/0000-0002-0866-0834","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mails:","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052577422","display_name":"Simona Perri","orcid":"https://orcid.org/0000-0002-8036-5709"},"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":"SIMONA PERRI","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mails:","Department of Mathematics and Computer Science, University of Calabria, Rende, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8036-5709","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mails:","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000628500","display_name":"Jessica Zangari","orcid":"https://orcid.org/0000-0002-6418-7711"},"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":"JESSICA ZANGARI","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mails:","Department of Mathematics and Computer Science, University of Calabria, Rende, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mails:","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034672297"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":1.5842,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.87044089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"19","issue":"04","first_page":"603","last_page":"628"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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.9998000264167786,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9962999820709229,"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.9865999817848206,"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/answer-set-programming","display_name":"Answer set programming","score":0.8835464119911194},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.8081833124160767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8011527061462402},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7302649021148682},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5829882025718689},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5252040028572083},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4880603551864624},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4799692630767822},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46146848797798157},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4341161847114563},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18530374765396118}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8835464119911194},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8081833124160767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8011527061462402},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7302649021148682},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5829882025718689},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5252040028572083},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4880603551864624},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4799692630767822},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46146848797798157},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4341161847114563},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18530374765396118},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068419000036","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000036","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:1812.09718","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.09718","pdf_url":"https://arxiv.org/pdf/1812.09718","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1812.09718","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.09718","pdf_url":"https://arxiv.org/pdf/1812.09718","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W101294428","https://openalex.org/W584191950","https://openalex.org/W1484403583","https://openalex.org/W1488953560","https://openalex.org/W1493657719","https://openalex.org/W1511336005","https://openalex.org/W1551250655","https://openalex.org/W1560870503","https://openalex.org/W1787538678","https://openalex.org/W1969965298","https://openalex.org/W1976055110","https://openalex.org/W1992810975","https://openalex.org/W2011124182","https://openalex.org/W2023141722","https://openalex.org/W2029448190","https://openalex.org/W2034521022","https://openalex.org/W2049791401","https://openalex.org/W2056062068","https://openalex.org/W2056850725","https://openalex.org/W2076698873","https://openalex.org/W2091138122","https://openalex.org/W2099531973","https://openalex.org/W2100699693","https://openalex.org/W2103446906","https://openalex.org/W2103797177","https://openalex.org/W2117839162","https://openalex.org/W2121444716","https://openalex.org/W2158985358","https://openalex.org/W2211798527","https://openalex.org/W2255903435","https://openalex.org/W2265638991","https://openalex.org/W2295882966","https://openalex.org/W2401337862","https://openalex.org/W2406583502","https://openalex.org/W2423871547","https://openalex.org/W2510852717","https://openalex.org/W2542150411","https://openalex.org/W2554080479","https://openalex.org/W2576170812","https://openalex.org/W2599723140","https://openalex.org/W2607115772","https://openalex.org/W2617661790","https://openalex.org/W2729610333","https://openalex.org/W2733732676","https://openalex.org/W2740051258","https://openalex.org/W2740349328","https://openalex.org/W2776804019","https://openalex.org/W2793298048","https://openalex.org/W2921667194","https://openalex.org/W2949623342","https://openalex.org/W2962726555","https://openalex.org/W2962859023","https://openalex.org/W2964023786","https://openalex.org/W2964210039","https://openalex.org/W3010945698"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W4312926500","https://openalex.org/W2041180560","https://openalex.org/W1511336005","https://openalex.org/W1903938722"],"abstract_inverted_index":{"Abstract":[0],"Answer":[1],"Set":[2],"Programming":[3],"(ASP)":[4],"is":[5,100,129],"a":[6,93,116,147],"purely":[7],"declarative":[8],"formalism":[9],"developed":[10],"in":[11,168,180],"the":[12,47,98,108,158,162,172,175,197,200],"field":[13],"of":[14,52,84,95,110,149,157,161,199],"logic":[15,25,68],"programming":[16],"and":[17,103,139,188],"non-monotonic":[18],"reasoning:":[19],"computational":[20],"problems":[21],"are":[22,33],"encoded":[23],"by":[24,35],"programs":[26,42],"whose":[27],"answer":[28],"sets,":[29],"corresponding":[30],"to":[31,101,114,120,136,170],"solutions,":[32],"computed":[34],"an":[36,61,66,71,124,191],"ASP":[37,125,163,176],"system.":[38,126],"Different,":[39],"semantically":[40],"equivalent,":[41],"can":[43,75,81,133],"be":[44,76,121,134],"defined":[45],"for":[46,63,88,195],"same":[48],"problem;":[49],"however,":[50],"performance":[51],"systems":[53],"evaluating":[54],"them":[55,106,167],"might":[56],"significantly":[57],"vary.":[58],"We":[59],"propose":[60],"approach":[62,173],"automatically":[64],"transforming":[65],"input":[67],"program":[69],"into":[70,92,123,174,182],"equivalent":[72],"one":[73,156],"that":[74],"evaluated":[77],"more":[78],"efficiently.":[79],"One":[80],"make":[82],"use":[83,166],"existing":[85],"tree-decomposition":[86],"techniques":[87],"rewriting":[89,118],"selected":[90],"rules":[91],"set":[94,148],"multiple":[96],"ones;":[97],"idea":[99],"guide":[102],"adaptively":[104],"apply":[105],"on":[107],"basis":[109],"proper":[111],"new":[112,150],"heuristics,":[113],"obtain":[115],"smart":[117],"algorithm":[119],"integrated":[122],"The":[127],"method":[128],"rather":[130],"general:":[131],"it":[132],"adapted":[135],"any":[137],"system":[138,177],"implement":[140,171],"different":[141],"preference":[142],"policies.":[143],"Furthermore,":[144],"we":[145,165],"define":[146],"heuristics":[151],"tailored":[152],"at":[153],"optimizing":[154],"grounding,":[155],"main":[159],"phases":[160],"computation;":[164],"order":[169],"DLV":[178],",":[179,187],"particular":[181],"its":[183],"grounding":[184],"subsystem":[185],"\u2110-DLV":[186],"carry":[189],"out":[190],"extensive":[192],"experimental":[193],"activity":[194],"assessing":[196],"impact":[198],"proposal.":[201]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}