{"id":"https://openalex.org/W2962688035","doi":"https://doi.org/10.1017/s1471068419000218","title":"On Uniform Equivalence of Epistemic Logic Programs","display_name":"On Uniform Equivalence of Epistemic Logic Programs","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2962688035","doi":"https://doi.org/10.1017/s1471068419000218","mag":"2962688035"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068419000218","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000218","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"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1907.10925","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"WOLFGANG FABER","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"WOLFGANG FABER","raw_affiliation_strings":["University of Klagenfurt, Austria (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Klagenfurt, Austria (e-mails:","institution_ids":["https://openalex.org/I4210166741"]}]},{"author_position":"middle","author":{"id":null,"display_name":"MICHAEL MORAK","orcid":"https://orcid.org/0000-0002-2077-7672"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"MICHAEL MORAK","raw_affiliation_strings":["University of Klagenfurt, Austria (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-2077-7672","affiliations":[{"raw_affiliation_string":"University of Klagenfurt, Austria (e-mails:","institution_ids":["https://openalex.org/I4210166741"]}]},{"author_position":"last","author":{"id":null,"display_name":"STEFAN WOLTRAN","orcid":null},"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":["TU Wien, Vienna, Austria (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria (e-mail:","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1584,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61215027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"19","issue":"5-6","first_page":"826","last_page":"840"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9912999868392944,"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.9912999868392944,"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.0026000000070780516,"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.0024999999441206455,"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.7986999750137329},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.6816999912261963},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6657999753952026},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5758000016212463},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5698000192642212},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4675999879837036},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.4153999984264374},{"id":"https://openalex.org/keywords/stable-model-semantics","display_name":"Stable model semantics","score":0.38119998574256897},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.3799999952316284}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.7986999750137329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6926000118255615},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.6816999912261963},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6657999753952026},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5758000016212463},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5698000192642212},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4675999879837036},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.45320001244544983},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4465000033378601},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.4153999984264374},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.38119998574256897},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.3799999952316284},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3716999888420105},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C154564781","wikidata":"https://www.wikidata.org/wiki/Q5384236","display_name":"Equational logic","level":3,"score":0.30309998989105225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3010999858379364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3000999987125397},{"id":"https://openalex.org/C194146651","wikidata":"https://www.wikidata.org/wiki/Q2119400","display_name":"Negation as failure","level":5,"score":0.2806999981403351},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2694999873638153},{"id":"https://openalex.org/C124047733","wikidata":"https://www.wikidata.org/wiki/Q5157327","display_name":"Computational logic","level":3,"score":0.2685000002384186},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.2590000033378601},{"id":"https://openalex.org/C2776542497","wikidata":"https://www.wikidata.org/wiki/Q5266672","display_name":"Development (topology)","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068419000218","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000218","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:1907.10925","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.10925","pdf_url":"https://arxiv.org/pdf/1907.10925","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1907.10925","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.10925","pdf_url":"https://arxiv.org/pdf/1907.10925","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W13737784","https://openalex.org/W1568591214","https://openalex.org/W1586014657","https://openalex.org/W1602726442","https://openalex.org/W1623618347","https://openalex.org/W1694306392","https://openalex.org/W1985274317","https://openalex.org/W1986999264","https://openalex.org/W1989634318","https://openalex.org/W2076698873","https://openalex.org/W2087432892","https://openalex.org/W2091138122","https://openalex.org/W2108736148","https://openalex.org/W2123740011","https://openalex.org/W2345230773","https://openalex.org/W2468539056","https://openalex.org/W2905529543","https://openalex.org/W3023767094","https://openalex.org/W4210897223","https://openalex.org/W4211177236","https://openalex.org/W6630562728","https://openalex.org/W6634971886","https://openalex.org/W6635789091","https://openalex.org/W6637298476","https://openalex.org/W6639213855","https://openalex.org/W6667153704","https://openalex.org/W6680694123","https://openalex.org/W6741749958","https://openalex.org/W6750578673","https://openalex.org/W6752991255","https://openalex.org/W6758868416","https://openalex.org/W6785049974"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Epistemic":[1],"Logic":[2],"Programs":[3],"(ELPs)":[4],"extend":[5],"Answer":[6],"Set":[7],"Programming":[8],"(ASP)":[9],"with":[10,49],"epistemic":[11],"negation":[12],"and":[13,29,59,102,156],"have":[14],"received":[15],"renewed":[16],"interest":[17],"in":[18,41],"recent":[19],"years.":[20],"This":[21,95],"led":[22],"to":[23,136],"the":[24,87,137,146,162,166],"development":[25],"of":[26,55,63,92,117,128,139,149,165],"new":[27],"research":[28],"efficient":[30],"solving":[31],"systems":[32],"for":[33,89,107,153],"ELPs.":[34],"In":[35,120],"practice,":[36],"ELPs":[37],"are":[38],"often":[39],"written":[40],"a":[42,78,126],"modular":[43],"way,":[44],"where":[45],"each":[46],"module":[47,79],"interacts":[48],"other":[50],"modules":[51],"by":[52,82],"accepting":[53],"sets":[54,62],"facts":[56,64],"as":[57,65,99,116],"input,":[58],"passing":[60],"on":[61,161],"output.":[66],"An":[67],"interesting":[68],"question":[69],"then":[70],"presents":[71],"itself:":[72],"under":[73],"which":[74],"conditions":[75],"can":[76,132],"such":[77,112],"be":[80,133],"replaced":[81],"another":[83],"one":[84],"without":[85],"changing":[86],"outcome,":[88],"any":[90],"set":[91],"input":[93],"facts?":[94],"problem":[96],"is":[97,160],"known":[98],"uniform":[100,129,151],"equivalence,":[101],"has":[103],"been":[104],"studied":[105],"extensively":[106],"ASP.":[108],"For":[109],"ELPs,":[110,155],"however,":[111],"an":[113],"investigation":[114],"is,":[115],"yet,":[118],"missing.":[119],"this":[121],"paper,":[122],"we":[123],"therefore":[124],"propose":[125],"characterization":[127],"equivalence":[130,152],"that":[131,158],"directly":[134],"applied":[135],"language":[138],"state-of-the-art":[140],"ELP":[141],"solvers.":[142],"We":[143],"also":[144],"investigate":[145],"computational":[147],"complexity":[148],"deciding":[150],"two":[154],"show":[157],"it":[159],"third":[163],"level":[164],"polynomial":[167],"hierarchy.":[168]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2019-07-30T00:00:00"}