{"id":"https://openalex.org/W2798667534","doi":"https://doi.org/10.1017/s1471068418000145","title":"Cautious reasoning in ASP via minimal models and unsatisfiable cores","display_name":"Cautious reasoning in ASP via minimal models and unsatisfiable cores","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2798667534","doi":"https://doi.org/10.1017/s1471068418000145","mag":"2798667534"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068418000145","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000145","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2AFAB47B545677DF5D8B3367202E9081/S1471068418000145a.pdf/div-class-title-cautious-reasoning-in-asp-via-minimal-models-and-unsatisfiable-cores-div.pdf","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2AFAB47B545677DF5D8B3367202E9081/S1471068418000145a.pdf/div-class-title-cautious-reasoning-in-asp-via-minimal-models-and-unsatisfiable-cores-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039882261","display_name":"Mario Alviano","orcid":"https://orcid.org/0000-0002-2052-2063"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"MARIO ALVIANO","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031224507","display_name":"Carmine Dodaro","orcid":"https://orcid.org/0000-0002-5617-5286"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"CARMINE DODARO","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081120128","display_name":"Matti J\u0084\u00e4rvisalo","orcid":"https://orcid.org/0000-0003-2572-063X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MATTI J\u00c4RVISALO","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077756388","display_name":"Marco Maratea","orcid":"https://orcid.org/0000-0002-9034-2527"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MARCO MARATEA","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068784737","display_name":"Alessandro Previti","orcid":"https://orcid.org/0000-0003-4209-2946"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ALESSANDRO PREVITI","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5039882261"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.03894435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":"3-4","first_page":"319","last_page":"336"},"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.9957000017166138,"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.9871000051498413,"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.8888672590255737},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7520840167999268},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6052554845809937},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5791063904762268},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5500786900520325},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5060185790061951},{"id":"https://openalex.org/keywords/question-answering","display_name":"Question answering","score":0.4656556248664856},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.46527099609375},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.44264334440231323},{"id":"https://openalex.org/keywords/falsity","display_name":"Falsity","score":0.4371945261955261},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.43099239468574524},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.42451170086860657},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.42101892828941345},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3915329575538635},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2722334861755371}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8888672590255737},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7520840167999268},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6052554845809937},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5791063904762268},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5500786900520325},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5060185790061951},{"id":"https://openalex.org/C44291984","wikidata":"https://www.wikidata.org/wiki/Q1074173","display_name":"Question answering","level":2,"score":0.4656556248664856},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.46527099609375},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.44264334440231323},{"id":"https://openalex.org/C2777685122","wikidata":"https://www.wikidata.org/wiki/Q170028","display_name":"Falsity","level":2,"score":0.4371945261955261},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.43099239468574524},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.42451170086860657},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.42101892828941345},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3915329575538635},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2722334861755371},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1017/s1471068418000145","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000145","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2AFAB47B545677DF5D8B3367202E9081/S1471068418000145a.pdf/div-class-title-cautious-reasoning-in-asp-via-minimal-models-and-unsatisfiable-cores-div.pdf","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:1804.08480","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.08480","pdf_url":"https://arxiv.org/pdf/1804.08480","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":"","raw_type":"text"},{"id":"mag:2798667534","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1804.08480.pdf","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:helda.helsinki.fi:10138/309057","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/309057","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:iris.unige.it:11567/921450","is_oa":false,"landing_page_url":"http://hdl.handle.net/11567/921450","pdf_url":null,"source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.1804.08480","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1804.08480","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1017/s1471068418000145","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000145","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2AFAB47B545677DF5D8B3367202E9081/S1471068418000145a.pdf/div-class-title-cautious-reasoning-in-asp-via-minimal-models-and-unsatisfiable-cores-div.pdf","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"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1464101492","display_name":null,"funder_award_id":"FESR 2014-2020","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G2628364946","display_name":null,"funder_award_id":"H2020","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G453067482","display_name":null,"funder_award_id":"014-2020","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G5634946813","display_name":null,"funder_award_id":"2014-2020","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G7331901853","display_name":null,"funder_award_id":"EU H2020","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null},{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2798667534.pdf","grobid_xml":"https://content.openalex.org/works/W2798667534.grobid-xml"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W20278294","https://openalex.org/W89175885","https://openalex.org/W165019675","https://openalex.org/W1484403583","https://openalex.org/W1500460229","https://openalex.org/W1557663601","https://openalex.org/W1568917966","https://openalex.org/W1572756262","https://openalex.org/W1606891084","https://openalex.org/W1639901403","https://openalex.org/W1672891595","https://openalex.org/W1976055110","https://openalex.org/W1993398079","https://openalex.org/W2011958646","https://openalex.org/W2013130775","https://openalex.org/W2018172994","https://openalex.org/W2034521022","https://openalex.org/W2044560939","https://openalex.org/W2049791401","https://openalex.org/W2051475155","https://openalex.org/W2076698873","https://openalex.org/W2091138122","https://openalex.org/W2100983017","https://openalex.org/W2123120140","https://openalex.org/W2149516981","https://openalex.org/W2150903551","https://openalex.org/W2150932843","https://openalex.org/W2152131859","https://openalex.org/W2167440926","https://openalex.org/W2174399230","https://openalex.org/W2178708778","https://openalex.org/W2198541531","https://openalex.org/W2211798527","https://openalex.org/W2222364239","https://openalex.org/W2265638991","https://openalex.org/W2295882966","https://openalex.org/W2397927460","https://openalex.org/W2405869186","https://openalex.org/W2406975053","https://openalex.org/W2407856297","https://openalex.org/W2471277801","https://openalex.org/W2505202112","https://openalex.org/W2506402500","https://openalex.org/W2554080479","https://openalex.org/W2733732676","https://openalex.org/W2741314198","https://openalex.org/W2755687384","https://openalex.org/W2790580136","https://openalex.org/W2810688680","https://openalex.org/W2893869123","https://openalex.org/W2949217420","https://openalex.org/W2964025544","https://openalex.org/W3104588709","https://openalex.org/W6600829311","https://openalex.org/W6720352985","https://openalex.org/W6754832762"],"related_works":["https://openalex.org/W2394839833","https://openalex.org/W2207566822","https://openalex.org/W3101690952","https://openalex.org/W2903626706","https://openalex.org/W3142377258","https://openalex.org/W3200411040","https://openalex.org/W2944191408","https://openalex.org/W2470660316","https://openalex.org/W3108137713","https://openalex.org/W2111746093","https://openalex.org/W1970635026","https://openalex.org/W2176981155","https://openalex.org/W2006998981","https://openalex.org/W49733910","https://openalex.org/W2741681596","https://openalex.org/W3037734777","https://openalex.org/W1510222959","https://openalex.org/W2263562125","https://openalex.org/W2551482414","https://openalex.org/W2573805868"],"abstract_inverted_index":{"Abstract":[0],"Answer":[1],"Set":[2],"Programming":[3],"(ASP)":[4],"is":[5,48,84,103],"a":[6,39,45,67,89,118],"logic-based":[7],"knowledge":[8],"representation":[9],"framework,":[10],"supporting\u2014among":[11],"other":[12],"reasoning":[13],"modes\u2014the":[14],"central":[15],"task":[16],"of":[17,31,42,66,70,78,94,117,129,135,149,157,163,172,202],"query":[18,24],"answering.":[19],"In":[20],"the":[21,32,36,57,64,71,76,82,92,101,115,127,133,137,155,188,194,200,203],"propositional":[22],"case,":[23],"answering":[25],"amounts":[26],"to":[27,52,105,109,139],"computing":[28],"cautious":[29,46,130],"consequences":[30],"input":[33,72],"program":[34,73],"among":[35],"atoms":[37],"in":[38,180],"given":[40],"set":[41,156],"candidates,":[43,159],"where":[44,81,160],"consequence":[47],"an":[49],"atom":[50],"belonging":[51],"all":[53],"stable":[54,68,119,142],"models.":[55],"Currently,":[56],"most":[58],"efficient":[59],"algorithms":[60,125,151,177,196],"either":[61],"iteratively":[62],"verify":[63],"existence":[65],"model":[69],"extended":[74],"with":[75,132],"complement":[77],"one":[79,97,148],"candidate,":[80,98],"candidate":[83,108],"heuristically":[85],"selected,":[86],"or":[87],"introduce":[88],"clause":[90],"enforcing":[91],"falsity":[93],"at":[95,111],"least":[96],"so":[99],"that":[100,193],"solver":[102,138],"free":[104],"choose":[106],"which":[107],"falsify":[110],"any":[112],"time":[113],"during":[114],"computation":[116,128],"model.":[120],"This":[121],"paper":[122],"introduces":[123],"new":[124,195],"for":[126,141],"consequences,":[131],"aim":[134],"driving":[136],"search":[140],"models":[143],"discarding":[144],"more":[145],"candidates.":[146],"Specifically,":[147],"such":[150],"enforces":[152],"minimality":[153,164],"on":[154,185],"true":[158],"different":[161],"notions":[162],"can":[165],"be":[166],"used,":[167],"and":[168,183],"another":[169],"takes":[170],"advantage":[171],"unsatisfiable":[173],"cores":[174],"computation.":[175],"The":[176],"are":[178],"implemented":[179],"wasp":[181],",":[182],"experiments":[184],"benchmarks":[186],"from":[187],"latest":[189],"ASP":[190],"competitions":[191],"show":[192],"perform":[197],"better":[198],"than":[199],"state":[201],"art.":[204]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}