{"id":"https://openalex.org/W3048214730","doi":"https://doi.org/10.1017/s147106842000040x","title":"Incremental maintenance of overgrounded logic programs with tailored simplifications","display_name":"Incremental maintenance of overgrounded logic programs with tailored simplifications","publication_year":2020,"publication_date":"2020-09-01","ids":{"openalex":"https://openalex.org/W3048214730","doi":"https://doi.org/10.1017/s147106842000040x","mag":"3048214730"},"language":"en","primary_location":{"id":"doi:10.1017/s147106842000040x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106842000040x","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2008.04108","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070729128","display_name":"Giovambattista Ianni","orcid":"https://orcid.org/0000-0003-0534-6425"},"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":"Giovambattista Ianni","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mail:","University of Calabria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"University of Calabria","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085903491","display_name":"Francesco Pacenza","orcid":"https://orcid.org/0000-0001-6632-3492"},"institutions":[{"id":"https://openalex.org/I3970730","display_name":"University of Calabar","ror":"https://ror.org/05qderh61","country_code":"NG","type":"education","lineage":["https://openalex.org/I3970730"]},{"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","NG"],"is_corresponding":false,"raw_author_name":"Francesco Pacenza","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mail:","University of Calabar"],"raw_orcid":"https://orcid.org/0000-0001-6632-3492","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"University of Calabar","institution_ids":["https://openalex.org/I3970730"]}]},{"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-mail:","University of Calabria"],"raw_orcid":"https://orcid.org/0000-0002-6418-7711","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Rende, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"University of Calabria","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3160,"currency":"USD","value_usd":3160},"apc_paid":null,"fwci":0.2841,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68069509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"20","issue":"5","first_page":"719","last_page":"734"},"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.9979000091552734,"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.9968000054359436,"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.7875867486000061},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.6830118298530579},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6056819558143616},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5911328196525574},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5567836761474609},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4650503396987915},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4636813998222351},{"id":"https://openalex.org/keywords/non-monotonic-logic","display_name":"Non-monotonic logic","score":0.43790990114212036},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3713298738002777},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3517117202281952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11851593852043152}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7875867486000061},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.6830118298530579},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6056819558143616},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5911328196525574},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5567836761474609},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4650503396987915},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4636813998222351},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.43790990114212036},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3713298738002777},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3517117202281952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11851593852043152},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s147106842000040x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106842000040x","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:2008.04108","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.04108","pdf_url":"https://arxiv.org/pdf/2008.04108","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"},{"id":"mag:3048214730","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2008.04108v1","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2008.04108","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2008.04108","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2008.04108","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.04108","pdf_url":"https://arxiv.org/pdf/2008.04108","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":29,"referenced_works":["https://openalex.org/W38786560","https://openalex.org/W1484110122","https://openalex.org/W2036241121","https://openalex.org/W2049791401","https://openalex.org/W2103446906","https://openalex.org/W2105869173","https://openalex.org/W2121444716","https://openalex.org/W2154392574","https://openalex.org/W2211798527","https://openalex.org/W2536253745","https://openalex.org/W2548589638","https://openalex.org/W2554080479","https://openalex.org/W2569196563","https://openalex.org/W2607115772","https://openalex.org/W2734376583","https://openalex.org/W2795195482","https://openalex.org/W2806801598","https://openalex.org/W2888332150","https://openalex.org/W2905350678","https://openalex.org/W2907184427","https://openalex.org/W2949623342","https://openalex.org/W2963244003","https://openalex.org/W2963927607","https://openalex.org/W2964210039","https://openalex.org/W2964290644","https://openalex.org/W2966046769","https://openalex.org/W3098371272","https://openalex.org/W3106212667","https://openalex.org/W6738388615"],"related_works":["https://openalex.org/W1584616449","https://openalex.org/W1656563103","https://openalex.org/W2357568692","https://openalex.org/W2776725176","https://openalex.org/W2963503788","https://openalex.org/W1547870851","https://openalex.org/W1490311862","https://openalex.org/W2252786671","https://openalex.org/W1552645610","https://openalex.org/W1973303316","https://openalex.org/W2408528200","https://openalex.org/W2468310880","https://openalex.org/W2626584434","https://openalex.org/W1800180205","https://openalex.org/W1181962483","https://openalex.org/W1485323341","https://openalex.org/W196328319","https://openalex.org/W778229461","https://openalex.org/W3104527097","https://openalex.org/W1504713652"],"abstract_inverted_index":{"Abstract":[0],"The":[1,83],"repeated":[2],"execution":[3],"of":[4,34,44,54,60,78,108,142,152],"reasoning":[5,16],"tasks":[6],"is":[7],"desirable":[8],"in":[9,25,42,63,93,116,129],"many":[10],"applicative":[11],"scenarios,":[12],"such":[13,26],"as":[14],"stream":[15],"and":[17,91,154,166,171],"event":[18],"processing.":[19],"When":[20],"using":[21],"answer":[22],"set":[23],"programming":[24],"contexts,":[27],"one":[28],"can":[29,88],"avoid":[30],"the":[31,57,64,106,124,149],"iterative":[32],"generation":[33],"ground":[35,144],"programs":[36,85,145],"thus":[37],"achieving":[38],"a":[39,72,140],"significant":[40],"payoff":[41],"terms":[43],"computing":[45],"time.":[46],"However,":[47],"this":[48,133],"may":[49],"require":[50],"some":[51],"additional":[52],"amount":[53],"memory":[55],"and/or":[56],"manual":[58],"addition":[59],"operational":[61],"directives":[62],"declarative":[65],"knowledge":[66],"base":[67],"at":[68,148],"hand.":[69],"We":[70,159],"introduce":[71,137],"new":[73],"strategy":[74],"for":[75],"generating":[76],"series":[77],"monotonically":[79],"growing":[80],"propositional":[81],"programs.":[82,110],"proposedovergrounded":[84],"with":[86,95],"tailoring(OPTs)":[87],"be":[89],"updated":[90],"reused":[92],"combination":[94],"consecutive":[96],"inputs.":[97],"With":[98],"respect":[99],"to":[100,121],"earlier":[101],"approaches,":[102],"ourtailored":[103],"simplificationtechnique":[104],"reduces":[105],"size":[107,117],"instantiated":[109],"A":[111],"maintained":[112],"OPT":[113,163],"slowly":[114],"grows":[115],"from":[118],"an":[119,162],"iteration":[120],"another":[122],"while":[123],"update":[125,164],"cost":[126],"decreases,":[127],"especially":[128],"later":[130],"iterations.":[131],"In":[132],"paper":[134],"we":[135,155],"formally":[136],"tailored":[138],"embeddings,":[139],"family":[141],"equivalence-preserving":[143],"which":[146],"are":[147],"theoretical":[150],"basis":[151],"OPTs":[153],"describe":[156],"their":[157],"properties.":[158],"then":[160],"illustrate":[161],"algorithm":[165],"report":[167],"about":[168],"our":[169],"implementation":[170],"its":[172],"performance.":[173]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2022-07-24T00:00:00"}