{"id":"https://openalex.org/W4415903168","doi":"https://doi.org/10.24963/kr.2025/57","title":"Model Checker for Recursive Aggregates","display_name":"Model Checker for Recursive Aggregates","publication_year":2025,"publication_date":"2025-11-01","ids":{"openalex":"https://openalex.org/W4415903168","doi":"https://doi.org/10.24963/kr.2025/57"},"language":null,"primary_location":{"id":"doi:10.24963/kr.2025/57","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2025/57","pdf_url":"https://proceedings.kr.org/2025/57/kr2025-0057-alviano-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the TwentySecond International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://proceedings.kr.org/2025/57/kr2025-0057-alviano-et-al.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039882261","display_name":"Mario Alviano","orcid":"https://orcid.org/0000-0002-2052-2063"},"institutions":[{"id":"https://openalex.org/I4210116091","display_name":"Department of Physics, Mathematics and Informatics","ror":"https://ror.org/023sm4k53","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210116091"]},{"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":["BY","IT"],"is_corresponding":true,"raw_author_name":"Mario Alviano","raw_affiliation_strings":["Department of Mathematics and Computer Science, University","of Calabria"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University","institution_ids":["https://openalex.org/I4210116091"]},{"raw_affiliation_string":"of Calabria","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031224507","display_name":"Carmine Dodaro","orcid":"https://orcid.org/0000-0002-5617-5286"},"institutions":[{"id":"https://openalex.org/I4210116091","display_name":"Department of Physics, Mathematics and Informatics","ror":"https://ror.org/023sm4k53","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210116091"]},{"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":["BY","IT"],"is_corresponding":false,"raw_author_name":"Carmine Dodaro","raw_affiliation_strings":["Department of Mathematics and Computer Science, University","of Calabria"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University","institution_ids":["https://openalex.org/I4210116091"]},{"raw_affiliation_string":"of Calabria","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091628971","display_name":"Salvatore Fiorentino","orcid":null},"institutions":[{"id":"https://openalex.org/I4210116091","display_name":"Department of Physics, Mathematics and Informatics","ror":"https://ror.org/023sm4k53","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210116091"]},{"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":["BY","IT"],"is_corresponding":false,"raw_author_name":"Salvatore Fiorentino","raw_affiliation_strings":["Department of Mathematics and Computer Science, University","of Calabria"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University","institution_ids":["https://openalex.org/I4210116091"]},{"raw_affiliation_string":"of Calabria","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039882261"],"corresponding_institution_ids":["https://openalex.org/I4210116091","https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33177606,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"588","last_page":"598"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.46950000524520874,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.46950000524520874,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.3057999908924103,"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.08060000091791153,"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/correctness","display_name":"Correctness","score":0.7709000110626221},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7013000249862671},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5108000040054321},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5085999965667725},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5073999762535095},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.427700012922287},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.4146000146865845},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.38339999318122864},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.37610000371932983}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7709000110626221},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7013000249862671},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6470000147819519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.535099983215332},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5108000040054321},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5085999965667725},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5073999762535095},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.427700012922287},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.4146000146865845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41040000319480896},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3880999982357025},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.38339999318122864},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.32749998569488525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3183000087738037},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.30979999899864197},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.28040000796318054},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.2646999955177307},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2572000026702881}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/kr.2025/57","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2025/57","pdf_url":"https://proceedings.kr.org/2025/57/kr2025-0057-alviano-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the TwentySecond International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/kr.2025/57","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2025/57","pdf_url":"https://proceedings.kr.org/2025/57/kr2025-0057-alviano-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the TwentySecond International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3303352628","display_name":null,"funder_award_id":"H53C22000800006","funder_id":"https://openalex.org/F4320321781","funder_display_name":"Ministero della Salute"},{"id":"https://openalex.org/G4822691982","display_name":null,"funder_award_id":"CUP H53C22000650006","funder_id":"https://openalex.org/F4320321781","funder_display_name":"Ministero della Salute"},{"id":"https://openalex.org/G5273308604","display_name":null,"funder_award_id":"H53C22000650006","funder_id":"https://openalex.org/F4320321781","funder_display_name":"Ministero della Salute"},{"id":"https://openalex.org/G6734897840","display_name":null,"funder_award_id":"CUP H53C22000800006","funder_id":"https://openalex.org/F4320321781","funder_display_name":"Ministero della Salute"}],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320321781","display_name":"Ministero della Salute","ror":"https://ror.org/00789fa95"},{"id":"https://openalex.org/F4320321817","display_name":"Ministerio de Salud de la Naci\u00f3n","ror":"https://ror.org/024h8p458"},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415903168.pdf","grobid_xml":"https://content.openalex.org/works/W4415903168.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Model":[0],"checking":[1,141],"for":[2,10,142],"disjunctive":[3,143],"logic":[4],"programs":[5,144],"is":[6],"a":[7],"co-NP-complete":[8],"task":[9],"which":[11],"two":[12],"main":[13],"state-of-the-art":[14],"approaches":[15],"exist:":[16],"one":[17],"based":[18,31],"on":[19,32],"the":[20,56,61,68,90,102,137],"unsatisfiability":[21],"of":[22,63,118,139],"SAT":[23,78],"formulas":[24],"derived":[25],"from":[26],"program":[27],"reducts,":[28],"and":[29,39,83],"another":[30],"unfounded":[33],"sets.":[34],"Although":[35],"both":[36,97],"are":[37],"effective":[38],"efficient,":[40],"their":[41],"original":[42],"formulations":[43],"do":[44],"not":[45,129],"support":[46],"recursive":[47],"aggregates.":[48,65,146],"This":[49],"paper":[50],"extends":[51],"previous":[52],"work":[53],"by":[54],"tackling":[55],"stability":[57,110],"check":[58],"problem":[59],"in":[60],"presence":[62],"such":[64],"We":[66],"generalize":[67],"reduct-based":[69],"approach":[70,92],"to":[71,93,112],"operate":[72],"over":[73],"pseudo-Boolean":[74],"theories":[75],"rather":[76],"than":[77],"encodings,":[79],"yielding":[80],"more":[81],"compact":[82],"efficient":[84],"formulations.":[85],"In":[86],"parallel,":[87],"we":[88,107],"extend":[89],"unfounded-set-based":[91],"incorporate":[94],"aggregates,":[95],"integrating":[96],"strategies":[98,128],"as":[99],"propagators":[100],"within":[101],"ASP":[103],"solver":[104],"clingo.":[105],"Additionally,":[106],"introduce":[108],"partial":[109],"checks":[111],"enable":[113],"incremental":[114],"or":[115],"approximate":[116],"verification":[117],"model":[119,140],"stability.":[120],"Our":[121],"empirical":[122],"evaluation":[123],"demonstrates":[124],"that":[125],"these":[126],"novel":[127],"only":[130],"preserve":[131],"correctness":[132],"but":[133],"also":[134],"substantially":[135],"improve":[136],"efficiency":[138],"with":[145]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-11-05T00:00:00"}