{"id":"https://openalex.org/W2202727176","doi":"https://doi.org/10.1017/s1471068415000228","title":"Rewriting recursive aggregates in answer set programming: back to monotonicity","display_name":"Rewriting recursive aggregates in answer set programming: back to monotonicity","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W2202727176","doi":"https://doi.org/10.1017/s1471068415000228","mag":"2202727176"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068415000228","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000228","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/1507.03923","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MARIO ALVIANO","orcid":null},"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":"MARIO ALVIANO","raw_affiliation_strings":["University of Calabria, Italy"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":null,"display_name":"WOLFGANG FABER","orcid":null},"institutions":[{"id":"https://openalex.org/I133837150","display_name":"University of Huddersfield","ror":"https://ror.org/05t1h8f27","country_code":"GB","type":"education","lineage":["https://openalex.org/I133837150"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"WOLFGANG FABER","raw_affiliation_strings":["University of Huddersfield, UK"],"affiliations":[{"raw_affiliation_string":"University of Huddersfield, UK","institution_ids":["https://openalex.org/I133837150"]}]},{"author_position":"last","author":{"id":null,"display_name":"MARTIN GEBSER","orcid":null},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"MARTIN GEBSER","raw_affiliation_strings":["Aalto University, HIIT, Finland"],"affiliations":[{"raw_affiliation_string":"Aalto University, HIIT, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":2.6708,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.91896994,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"4-5","first_page":"559","last_page":"573"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.984000027179718,"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.984000027179718,"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.0017999999690800905,"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.0015999999595806003,"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/rewriting","display_name":"Rewriting","score":0.8054999709129333},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.734000027179718},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.733299970626831},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.677299976348877},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5676000118255615},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5582000017166138},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.5418999791145325},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4771000146865845}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8054999709129333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.791100025177002},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.734000027179718},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.733299970626831},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.677299976348877},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5676000118255615},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5582000017166138},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.5418999791145325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49970000982284546},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4771000146865845},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40849998593330383},{"id":"https://openalex.org/C62360110","wikidata":"https://www.wikidata.org/wiki/Q96777007","display_name":"Circumscription","level":2,"score":0.36980000138282776},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.3447999954223633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3441999852657318},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.32249999046325684},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.3147999942302704},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26669999957084656},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.259799987077713},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C199879729","wikidata":"https://www.wikidata.org/wiki/Q205140","display_name":"Infinite set","level":3,"score":0.2556000053882599}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068415000228","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000228","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:1507.03923","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.03923","pdf_url":"https://arxiv.org/pdf/1507.03923","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:publications/c3b43a98-4807-494d-94ab-ecc0d52c00f4","is_oa":false,"landing_page_url":"https://pure.hud.ac.uk/en/publications/c3b43a98-4807-494d-94ab-ecc0d52c00f4","pdf_url":null,"source":{"id":"https://openalex.org/S4306402508","display_name":"Huddersfield Research Portal (University of Huddersfield)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I133837150","host_organization_name":"University of Huddersfield","host_organization_lineage":["https://openalex.org/I133837150"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alviano, M, Faber, W & Gebser, M 2015, 'Rewriting recursive aggregates in answer set programming : Back to monotonicity', Theory and Practice of Logic Programming, vol. 15, no. 4-5, pp. 559-573. https://doi.org/10.1017/S1471068415000228","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1507.03923","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.03923","pdf_url":"https://arxiv.org/pdf/1507.03923","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1752491870","https://openalex.org/W1985274317","https://openalex.org/W1988666619","https://openalex.org/W2011124182","https://openalex.org/W2023346713","https://openalex.org/W2029702617","https://openalex.org/W2049791401","https://openalex.org/W2050842068","https://openalex.org/W2050890691","https://openalex.org/W2059245949","https://openalex.org/W2064864283","https://openalex.org/W2066012259","https://openalex.org/W2066287719","https://openalex.org/W2069156007","https://openalex.org/W2076698873","https://openalex.org/W2087432892","https://openalex.org/W2087563242","https://openalex.org/W2091138122","https://openalex.org/W2100699693","https://openalex.org/W2100983017","https://openalex.org/W2106500031","https://openalex.org/W2123120140","https://openalex.org/W2140181437","https://openalex.org/W2151485489","https://openalex.org/W2153361264","https://openalex.org/W2411666486","https://openalex.org/W2964029271","https://openalex.org/W3139333323","https://openalex.org/W6679270226"],"related_works":["https://openalex.org/W2099080307","https://openalex.org/W1500465483","https://openalex.org/W3139577592","https://openalex.org/W2791418195","https://openalex.org/W2339305611","https://openalex.org/W2044641374","https://openalex.org/W2189149666","https://openalex.org/W2357140223","https://openalex.org/W3104110719","https://openalex.org/W2951579968"],"abstract_inverted_index":{"Abstract":[0],"Aggregation":[1],"functions":[2,111],"are":[3,38,131],"widely":[4],"used":[5],"in":[6,28,57,80,83,134,148],"answer":[7],"set":[8],"programming":[9],"for":[10,107,124],"representing":[11],"and":[12,104],"reasoning":[13],"on":[14,59],"knowledge":[15],"involving":[16],"sets":[17],"of":[18,26,50,67,89,139],"objects":[19],"collectively.":[20],"Current":[21],"implementations":[22],"simplify":[23],"the":[24,32,48,65,113,135,140,145],"structure":[25],"programs":[27,52,69],"order":[29],"to":[30],"optimize":[31],"overall":[33],"performance.":[34],"In":[35],"particular,":[36],"aggregates":[37,55],"rewritten":[39],"into":[40,112],"simpler":[41,114],"forms":[42],"known":[43],"as":[44],"monotone":[45,54],"aggregates.":[46],"Since":[47],"evaluation":[49,66],"normal":[51,68],"with":[53,70,126],"is":[56,92],"general":[58],"a":[60,101],"lower":[61],"complexity":[62],"level":[63],"than":[64],"arbitrary":[71,127],"aggregates,":[72,129],"any":[73],"faithful":[74],"translation":[75,106],"function":[76,88],"must":[77],"introduce":[78],"disjunction":[79],"rule":[81],"heads":[82],"some":[84],"cases.":[85],"However,":[86],"no":[87],"this":[90,97,149],"kind":[91],"known.":[93],"The":[94],"paper":[95],"closes":[96],"gap":[98],"by":[99,117],"introducing":[100],"polynomial,":[102],"faithful,":[103],"modular":[105],"rewriting":[108],"common":[109],"aggregation":[110],"form":[115],"accepted":[116],"current":[118],"solvers.":[119],"A":[120],"prototype":[121],"system":[122],"allows":[123],"experimenting":[125],"recursive":[128],"which":[130],"also":[132],"supported":[133],"recent":[136],"version":[137],"4.5":[138],"grounder":[141],"gringo":[142],",":[143],"using":[144],"methods":[146],"presented":[147],"paper.":[150]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2016-06-24T00:00:00"}