{"id":"https://openalex.org/W2133225016","doi":"https://doi.org/10.1017/s147106841300001x","title":"Complexity of super-coherence problems in ASP","display_name":"Complexity of super-coherence problems in ASP","publication_year":2013,"publication_date":"2013-08-09","ids":{"openalex":"https://openalex.org/W2133225016","doi":"https://doi.org/10.1017/s147106841300001x","mag":"2133225016"},"language":"en","primary_location":{"id":"doi:10.1017/s147106841300001x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106841300001x","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/1212.5895","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MARIO ALVIANO","orcid":null},"institutions":[{"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":["IT"],"is_corresponding":true,"raw_author_name":"MARIO ALVIANO","raw_affiliation_strings":["University of Calabria, Rende (CS) 87036, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende (CS) 87036, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":null,"display_name":"WOLFGANG FABER","orcid":null},"institutions":[{"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":["IT"],"is_corresponding":false,"raw_author_name":"WOLFGANG FABER","raw_affiliation_strings":["University of Calabria, Rende (CS) 87036, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende (CS) 87036, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"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":["Vienna University of Technology, Vienna 1040, Austria (e-mail:"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna 1040, Austria (e-mail:","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.1181732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"3","first_page":"339","last_page":"361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9818000197410583,"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.9818000197410583,"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.004100000020116568,"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.003599999938160181,"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.891700029373169},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.6636000275611877},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5892999768257141},{"id":"https://openalex.org/keywords/magic","display_name":"MAGIC (telescope)","score":0.5838000178337097},{"id":"https://openalex.org/keywords/reduct","display_name":"Reduct","score":0.5679000020027161},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.483599990606308},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.4253999888896942},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.37299999594688416},{"id":"https://openalex.org/keywords/stable-model-semantics","display_name":"Stable model semantics","score":0.35409998893737793}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.891700029373169},{"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/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6636000275611877},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5892999768257141},{"id":"https://openalex.org/C2777704519","wikidata":"https://www.wikidata.org/wiki/Q45732","display_name":"MAGIC (telescope)","level":2,"score":0.5838000178337097},{"id":"https://openalex.org/C69177213","wikidata":"https://www.wikidata.org/wiki/Q12880812","display_name":"Reduct","level":3,"score":0.5679000020027161},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48980000615119934},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.483599990606308},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46630001068115234},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.4253999888896942},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.35409998893737793},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.3246000111103058},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32199999690055847},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2897000014781952},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.27869999408721924},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2703000009059906},{"id":"https://openalex.org/C164953516","wikidata":"https://www.wikidata.org/wiki/Q320357","display_name":"Closed set","level":2,"score":0.2547999918460846},{"id":"https://openalex.org/C12439846","wikidata":"https://www.wikidata.org/wiki/Q4809258","display_name":"Database theory","level":3,"score":0.2533999979496002},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s147106841300001x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106841300001x","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:1212.5895","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1212.5895","pdf_url":"https://arxiv.org/pdf/1212.5895","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":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1212.5895","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1212.5895","pdf_url":"https://arxiv.org/pdf/1212.5895","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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1491267207","https://openalex.org/W1572756262","https://openalex.org/W1606891084","https://openalex.org/W1820259543","https://openalex.org/W1971626643","https://openalex.org/W1976055110","https://openalex.org/W1978108034","https://openalex.org/W2023141722","https://openalex.org/W2024943265","https://openalex.org/W2025970985","https://openalex.org/W2034521022","https://openalex.org/W2037019297","https://openalex.org/W2056850725","https://openalex.org/W2075056819","https://openalex.org/W2076698873","https://openalex.org/W2085193523","https://openalex.org/W2087432892","https://openalex.org/W2093089155","https://openalex.org/W2101666345","https://openalex.org/W2111353076","https://openalex.org/W2115282751","https://openalex.org/W2295882966","https://openalex.org/W6690237088"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Adapting":[1],"techniques":[2],"from":[3],"database":[4],"theory":[5],"in":[6,16,28,41,188,209],"order":[7],"to":[8,90,125,135,146,162,166],"optimize":[9],"Answer":[10],"Set":[11,35,102],"Programming":[12],"(ASP)":[13],"systems,":[14,23],"and":[15,44,221,230],"particular":[17],"the":[18,33,70,144,150,157,189,206,216,219,225,236,240],"grounding":[19],"components":[20],"of":[21,47,72,86,121,264],"ASP":[22,77,87,226,248],"is":[24,66,103,123,133,141,181,183,194,262],"an":[25],"important":[26],"topic":[27],"ASP.":[29,57],"In":[30,79,169],"recent":[31,81],"years,":[32],"Magic":[34,51,101],"method":[36],"has":[37,53,61,95],"received":[38],"some":[39],"interest":[40],"this":[42,59,170,210,260],"setting,":[43],"a":[45,62,80,83,138,178],"variant":[46],"it,":[48],"called":[49],"Dynamic":[50,100],"Set,":[52],"been":[54,96],"proposed":[55],"for":[56,75,98,199],"However,":[58],"technique":[60],"caveat,":[63],"because":[64],"it":[65,134,193],"not":[67],"correct":[68],"(in":[69],"sense":[71],"being":[73],"query-equivalent)":[74],"all":[76,108,246],"programs.":[78,201],"work,":[82],"large":[84],"fragment":[85,106],"programs,":[88,258],"referred":[89],"as":[91],"super-coherent":[92,147,182,257],"programs":[93,109,148,227],",":[94],"identified,":[97],"which":[99,110,119,224],"correct.":[104],"The":[105,202],"contains":[107],"possess":[111],"at":[112],"least":[113],"one":[114],"answer":[115,167],"set,":[116],"no":[117],"matter":[118],"set":[120],"facts":[122],"added":[124],"them.":[126],"Two":[127],"open":[128],"question":[129,159],"remained:":[130],"How":[131],"complex":[132],"determine":[136],"whether":[137,177],"given":[139,237],"program":[140,180],"super-coherent?":[142],"Does":[143],"restriction":[145],"limit":[149],"problems":[151],"that":[152,175,234,245],"can":[153,251],"be":[154,163,252],"solved?":[155],"Especially":[156],"first":[158],"turned":[160],"out":[161],"quite":[164],"difficult":[165,207],"precisely.":[168],"paper,":[171],"we":[172,243],"formally":[173],"prove":[174],"deciding":[176],"propositional":[179],"\u03a0":[184,195],"3":[185],"P":[186,197],"-complete":[187,198],"disjunctive":[190],"case,":[191],"while":[192],"2":[196],"normal":[200],"hardness":[203],"proofs":[204],"are":[205],"part":[208],"endeavor:":[211],"We":[212],"proceed":[213],"by":[214,218],"characterizing":[215],"reductions":[217],"models":[220,223],"reduct":[222],"should":[228],"have,":[229],"then":[231],"provide":[232],"instantiations":[233],"meet":[235],"specifications.":[238],"Concerning":[239],"second":[241],"question,":[242],"show":[244],"relevant":[247],"reasoning":[249],"tasks":[250,255],"transformed":[253],"into":[254],"over":[256],"although":[259],"transformation":[261],"more":[263],"theoretical":[265],"than":[266],"practical":[267],"interest.":[268]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}