{"id":"https://openalex.org/W4414339137","doi":"https://doi.org/10.1017/s1471068425100112","title":"ANTHEM 2.0: Automated Reasoning for Answer Set Programming","display_name":"ANTHEM 2.0: Automated Reasoning for Answer Set Programming","publication_year":2025,"publication_date":"2025-07-01","ids":{"openalex":"https://openalex.org/W4414339137","doi":"https://doi.org/10.1017/s1471068425100112"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068425100112","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068425100112","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/69D4B6430617A334906A99F787FA2727/S1471068425100112a.pdf/div-class-title-anthem-2-0-automated-reasoning-for-answer-set-programming-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/69D4B6430617A334906A99F787FA2727/S1471068425100112a.pdf/div-class-title-anthem-2-0-automated-reasoning-for-answer-set-programming-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056956560","display_name":"Jorge Fandi\u00f1o","orcid":"https://orcid.org/0000-0002-3917-8717"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"JORGE FANDINNO","raw_affiliation_strings":["University of Nebraska Omaha","University of Nebraska Omaha, Omaha, NE, USA (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-3917-8717","affiliations":[{"raw_affiliation_string":"University of Nebraska Omaha","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"University of Nebraska Omaha, Omaha, NE, USA (e-mails:","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057732993","display_name":"Zachary Hansen","orcid":"https://orcid.org/0000-0002-8447-4048"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ZACHARY HANSEN","raw_affiliation_strings":["University of Nebraska Omaha","University of Nebraska Omaha, Omaha, NE, USA (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-8447-4048","affiliations":[{"raw_affiliation_string":"University of Nebraska Omaha","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"University of Nebraska Omaha, Omaha, NE, USA (e-mails:","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008816972","display_name":"Yuliya Lierler","orcid":"https://orcid.org/0000-0002-6146-623X"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"YULIYA LIERLER","raw_affiliation_strings":["University of Nebraska Omaha","University of Nebraska Omaha, Omaha, NE, USA (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-6146-623X","affiliations":[{"raw_affiliation_string":"University of Nebraska Omaha","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"University of Nebraska Omaha, Omaha, NE, USA (e-mails:","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119671880","display_name":"CHRISTOPH GLINZER","orcid":null},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"CHRISTOPH GLINZER","raw_affiliation_strings":["University of Potsdam","University of Potsdam, Potsdam, Germany (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Potsdam","institution_ids":["https://openalex.org/I176453806"]},{"raw_affiliation_string":"University of Potsdam, Potsdam, Germany (e-mails:","institution_ids":["https://openalex.org/I176453806"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057193297","display_name":"Jan Heuer","orcid":"https://orcid.org/0009-0004-1545-9356"},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"JAN HEUER","raw_affiliation_strings":["University of Potsdam","University of Potsdam, Potsdam, Germany (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Potsdam","institution_ids":["https://openalex.org/I176453806"]},{"raw_affiliation_string":"University of Potsdam, Potsdam, Germany (e-mails:","institution_ids":["https://openalex.org/I176453806"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058467603","display_name":"Torsten Schaub","orcid":"https://orcid.org/0000-0002-7456-041X"},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"TORSTEN SCHAUB","raw_affiliation_strings":["University of Potsdam","University of Potsdam, Potsdam, Germany (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Potsdam","institution_ids":["https://openalex.org/I176453806"]},{"raw_affiliation_string":"University of Potsdam, Potsdam, Germany (e-mails:","institution_ids":["https://openalex.org/I176453806"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004713536","display_name":"Tobias Stolzmann","orcid":"https://orcid.org/0000-0002-1436-0715"},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"TOBIAS STOLZMANN","raw_affiliation_strings":["University of Potsdam","University of Potsdam, Potsdam, Germany (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Potsdam","institution_ids":["https://openalex.org/I176453806"]},{"raw_affiliation_string":"University of Potsdam, Potsdam, Germany (e-mails:","institution_ids":["https://openalex.org/I176453806"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076917986","display_name":"Vladimir Lifschitz","orcid":"https://orcid.org/0000-0001-6051-7907"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"VLADIMIR LIFSCHITZ","raw_affiliation_strings":["University of Texas at Austin","University of Texas at Austin, Austin, TX, USA (e-mail:"],"raw_orcid":"https://orcid.org/0000-0001-6051-7907","affiliations":[{"raw_affiliation_string":"University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA (e-mail:","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":8,"corresponding_author_ids":["https://openalex.org/A5056956560"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12689031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"4","first_page":"668","last_page":"684"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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.996399998664856,"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.9944999814033508,"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.796999990940094},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.651199996471405},{"id":"https://openalex.org/keywords/anthem","display_name":"Anthem","score":0.644599974155426},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6359000205993652},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5394999980926514},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.5149000287055969},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.5009999871253967},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4733999967575073},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4643999934196472}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8015000224113464},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.796999990940094},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7218000292778015},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.651199996471405},{"id":"https://openalex.org/C2780673261","wikidata":"https://www.wikidata.org/wiki/Q541947","display_name":"Anthem","level":2,"score":0.644599974155426},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6359000205993652},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5394999980926514},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.5149000287055969},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.5009999871253967},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4733999967575073},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4643999934196472},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.3853999972343445},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.3718999922275543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35109999775886536},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.33329999446868896},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.31279999017715454},{"id":"https://openalex.org/C5065155","wikidata":"https://www.wikidata.org/wiki/Q1185775","display_name":"Frame problem","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30219998955726624},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2856999933719635},{"id":"https://openalex.org/C10418432","wikidata":"https://www.wikidata.org/wiki/Q560370","display_name":"AND gate","level":3,"score":0.2741999924182892},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068425100112","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068425100112","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/69D4B6430617A334906A99F787FA2727/S1471068425100112a.pdf/div-class-title-anthem-2-0-automated-reasoning-for-answer-set-programming-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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:2507.11704","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.11704","pdf_url":"https://arxiv.org/pdf/2507.11704","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"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":"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":"doi:10.1017/s1471068425100112","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068425100112","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/69D4B6430617A334906A99F787FA2727/S1471068425100112a.pdf/div-class-title-anthem-2-0-automated-reasoning-for-answer-set-programming-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5539224673","display_name":"CAREER: Answer Set Programming for Quantitative Information","funder_award_id":"2338635","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320311308","display_name":"University of Nebraska Omaha","ror":"https://ror.org/04yrkc140"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414339137.pdf","grobid_xml":"https://content.openalex.org/works/W4414339137.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1781094","https://openalex.org/W1488842157","https://openalex.org/W1510612468","https://openalex.org/W1520300883","https://openalex.org/W1523341975","https://openalex.org/W1586434992","https://openalex.org/W1766332311","https://openalex.org/W1767045576","https://openalex.org/W1985274317","https://openalex.org/W2588018425","https://openalex.org/W2590401811","https://openalex.org/W2795456052","https://openalex.org/W2914398864","https://openalex.org/W2945261847","https://openalex.org/W3046518491","https://openalex.org/W3104088567","https://openalex.org/W3111484523","https://openalex.org/W4252975428","https://openalex.org/W4384698509","https://openalex.org/W4385513669","https://openalex.org/W4386987523","https://openalex.org/W4391030678"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"ANTHEM":[1,61,106],"2.0":[2,62,107],"is":[3],"a":[4,75,79],"tool":[5],"to":[6,72,78,83,104],"aid":[7],"in":[8,15,45],"the":[9,46,98],"verification":[10,66],"of":[11,19,48,53,89,97],"logic":[12,40,47,54],"programs":[13,41,55],"written":[14],"an":[16,95],"expressive":[17],"fragment":[18],"CLINGO":[20],"\u2019s":[21],"input":[22],"language":[23],"named":[24],"MINI-GRINGO,":[25],"which":[26],"includes":[27],"arithmetic":[28],"operations":[29],"and":[30,50,86,109],"simple":[31],"choice":[32],"rules":[33],"but":[34],"not":[35],"aggregates.":[36],"It":[37],"can":[38,63],"translate":[39],"into":[42],"formula":[43],"representations":[44],"here-and-there":[49],"analyze":[51],"properties":[52],"such":[56],"as":[57,94],"tightness.":[58],"Most":[59],"importantly,":[60],"support":[64],"program":[65,76],"by":[67],"invoking":[68],"first-order":[69,80],"theorem":[70],"provers":[71],"confirm":[73],"that":[74],"adheres":[77],"specification":[81],"or":[82],"establish":[84],"strong":[85],"external":[87],"equivalence":[88],"programs.":[90],"This":[91],"paper":[92],"serves":[93],"overview":[96],"system\u2019s":[99],"capabilities.":[100],"We":[101],"demonstrate":[102],"how":[103],"use":[105],"effectively":[108],"interpret":[110],"its":[111],"results.":[112]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-09-19T00:00:00"}