{"id":"https://openalex.org/W4415428596","doi":"https://doi.org/10.3233/faia250977","title":"A Novel Equivalence Notion to Compare Answer-Set Programs over Multi-Layered Inputs","display_name":"A Novel Equivalence Notion to Compare Answer-Set Programs over Multi-Layered Inputs","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4415428596","doi":"https://doi.org/10.3233/faia250977"},"language":null,"primary_location":{"id":"doi:10.3233/faia250977","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250977","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/faia250977","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074262091","display_name":"Tobias Geibinger","orcid":"https://orcid.org/0000-0002-0856-7162"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Tobias Geibinger","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024232019","display_name":"Zeynep G. Saribatur","orcid":"https://orcid.org/0000-0001-8690-5043"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Zeynep G. Saribatur","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006053030","display_name":"Stefan Woltran","orcid":"https://orcid.org/0000-0003-1594-8972"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Woltran","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074262091"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63115605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9793999791145325,"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/T10237","display_name":"Cryptography and Data Security","score":0.9390000104904175,"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/equivalence","display_name":"Equivalence (formal languages)","score":0.7889000177383423},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.6471999883651733},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5530999898910522},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.43479999899864197},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.3930000066757202},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.36149999499320984},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.35850000381469727}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7889000177383423},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.6471999883651733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5623000264167786},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5530999898910522},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45179998874664307},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.43479999899864197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4262999892234802},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.36149999499320984},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.35850000381469727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34950000047683716},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.2964000105857849},{"id":"https://openalex.org/C37926939","wikidata":"https://www.wikidata.org/wiki/Q7449061","display_name":"Semantic equivalence","level":4,"score":0.2957000136375427},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.289900004863739},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26429998874664307},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia250977","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250977","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia250977","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250977","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,17,30,73,132,149,170,183,188],"study":[2],"of":[3,7,67,135,151],"logic":[4,70],"programming,":[5,26],"notions":[6,99],"equivalence":[8,68,98,122,139],"play":[9],"a":[10,64,94,127,145,159],"significant":[11],"role.":[12],"This":[13],"is":[14,123,185],"due":[15],"to":[16,78],"fact":[18],"that":[19,39,76,84,96],"under":[20,72],"common":[21],"nonmonotonic":[22],"semantics,":[23],"like":[24,109],"answer-set":[25,74],"two":[27],"programs":[28,71,83],"sharing":[29],"same":[31],"models":[32],"(answer":[33],"sets)":[34],"does":[35],"not":[36,101],"necessarily":[37],"yield":[38],"they":[40],"are":[41],"equivalent":[42],"in":[43,148],"all":[44],"contexts.":[45],"Whether":[46],"this":[47],"context":[48],"concerns":[49],"other":[50],"program":[51],"modules":[52],"or":[53,112],"just":[54],"different":[55,88,92],"data,":[56],"distinguishes":[57],"strong":[58,136,175],"from":[59,87],"uniform":[60,138,177],"equivalence.":[61],"We":[62,143],"introduce":[63],"new":[65],"notion":[66,116],"for":[69],"semantics":[75],"allows":[77],"precisely":[79],"compare":[80],"and":[81,130,137,153,176],"simplify":[82],"receive":[85],"input":[86],"sources":[89],"(i.e.,":[90],"over":[91,126],"alphabets);":[93],"setting":[95],"previous":[97],"have":[100],"considered,":[102],"but":[103],"has":[104,131],"some":[105,155],"interesting":[106],"use":[107],"cases,":[108],"data":[110],"integration":[111],"belief":[113],"merging.":[114],"Our":[115],"further":[117],"generalizes":[118],"relativized":[119],"equivalence,":[120,178],"where":[121],"only":[124],"required":[125],"parameterized":[128],"context,":[129],"core":[133],"concepts":[134],"as":[140],"corner":[141],"cases.":[142],"provide":[144],"model-theoretic":[146],"characterization":[147],"spirit":[150],"SE-models":[152],"establish":[154],"theoretical":[156],"properties":[157],"including":[158],"thorough":[160],"complexity":[161,172],"analysis.":[162],"Furthermore,":[163],"using":[164],"our":[165],"notion,":[166],"we":[167],"can":[168],"pinpoint":[169],"known":[171],"gap":[173],"between":[174],"giving":[179],"insight":[180],"into":[181],"why":[182],"latter":[184],"harder":[186],"than":[187],"former.":[189]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-24T00:00:00"}