{"id":"https://openalex.org/W2402235836","doi":"https://doi.org/10.1609/aaai.v27i1.8624","title":"Backdoors to Normality for Disjunctive Logic Programs","display_name":"Backdoors to Normality for Disjunctive Logic Programs","publication_year":2013,"publication_date":"2013-06-30","ids":{"openalex":"https://openalex.org/W2402235836","doi":"https://doi.org/10.1609/aaai.v27i1.8624","mag":"2402235836"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v27i1.8624","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v27i1.8624","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/8624/8483","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/8624/8483","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089442472","display_name":"Johannes K. Fichte","orcid":"https://orcid.org/0000-0002-8681-7470"},"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":"Johannes Fichte","raw_affiliation_strings":["Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"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 Szeider","raw_affiliation_strings":["Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089442472"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":1.69573061,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.91514019,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"27","issue":"1","first_page":"320","last_page":"327"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"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.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9907000064849854,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8158056735992432},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.7462682723999023},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5753780603408813},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5483959913253784},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.5309046506881714},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5237762331962585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5156692266464233},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5010790824890137},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4760684370994568},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4288822114467621},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4250304102897644},{"id":"https://openalex.org/keywords/backdoor","display_name":"Backdoor","score":0.41820770502090454},{"id":"https://openalex.org/keywords/disjunctive-normal-form","display_name":"Disjunctive normal form","score":0.41719287633895874},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.41363561153411865},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.41157180070877075},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37534618377685547},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35615074634552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23583495616912842},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11382672190666199}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8158056735992432},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.7462682723999023},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5753780603408813},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5483959913253784},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.5309046506881714},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5237762331962585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5156692266464233},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5010790824890137},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4760684370994568},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4288822114467621},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4250304102897644},{"id":"https://openalex.org/C2781045450","wikidata":"https://www.wikidata.org/wiki/Q254569","display_name":"Backdoor","level":2,"score":0.41820770502090454},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.41719287633895874},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.41363561153411865},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.41157180070877075},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37534618377685547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35615074634552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23583495616912842},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11382672190666199},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v27i1.8624","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v27i1.8624","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/8624/8483","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v27i1.8624","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v27i1.8624","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/8624/8483","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2402235836.pdf","grobid_xml":"https://content.openalex.org/works/W2402235836.grobid-xml"},"referenced_works_count":68,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W91024833","https://openalex.org/W96215098","https://openalex.org/W195269230","https://openalex.org/W202248608","https://openalex.org/W1505818550","https://openalex.org/W1535382896","https://openalex.org/W1544722557","https://openalex.org/W1549449731","https://openalex.org/W1553364858","https://openalex.org/W1559081432","https://openalex.org/W1559927413","https://openalex.org/W1570425181","https://openalex.org/W1570891932","https://openalex.org/W1597298151","https://openalex.org/W1605107773","https://openalex.org/W1639901403","https://openalex.org/W1672891595","https://openalex.org/W1709155369","https://openalex.org/W1732327014","https://openalex.org/W1788645111","https://openalex.org/W1809040466","https://openalex.org/W1815595989","https://openalex.org/W1964680470","https://openalex.org/W2004414305","https://openalex.org/W2010160994","https://openalex.org/W2011992362","https://openalex.org/W2023141722","https://openalex.org/W2050842068","https://openalex.org/W2056850725","https://openalex.org/W2076698873","https://openalex.org/W2079430756","https://openalex.org/W2087432892","https://openalex.org/W2091138122","https://openalex.org/W2100699693","https://openalex.org/W2108736148","https://openalex.org/W2108911687","https://openalex.org/W2110804558","https://openalex.org/W2110992886","https://openalex.org/W2130987249","https://openalex.org/W2133527541","https://openalex.org/W2146128827","https://openalex.org/W2152131859","https://openalex.org/W2156861518","https://openalex.org/W2167808293","https://openalex.org/W2399343913","https://openalex.org/W2611415697","https://openalex.org/W4206807714","https://openalex.org/W4239400817","https://openalex.org/W4245630182","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W4301112185","https://openalex.org/W6603669909","https://openalex.org/W6603921552","https://openalex.org/W6608145652","https://openalex.org/W6632742798","https://openalex.org/W6636077381","https://openalex.org/W6637298476","https://openalex.org/W6637371358","https://openalex.org/W6637420055","https://openalex.org/W6638065767","https://openalex.org/W6638146627","https://openalex.org/W6638648401","https://openalex.org/W6673559633","https://openalex.org/W6683187346","https://openalex.org/W6737378204","https://openalex.org/W6841555922"],"related_works":["https://openalex.org/W2173621488","https://openalex.org/W2171811389","https://openalex.org/W2067983896","https://openalex.org/W1530996181","https://openalex.org/W2963038528","https://openalex.org/W2548856372","https://openalex.org/W2114785958","https://openalex.org/W4300874354","https://openalex.org/W2953129498","https://openalex.org/W2402235836"],"abstract_inverted_index":{"Over":[0],"the":[1,12,20,40,56,95,99,125,179,183,189,198,203,212,231,236,247,251,255,263,267,271,276,281,284,333],"last":[2],"two":[3,116],"decades,":[4],"propositional":[5,61],"satisfiability":[6],"(SAT)":[7],"has":[8],"become":[9],"one":[10,83],"of":[11,22,27,43,98,135,178,205,214,225,250,270,283,288,308,335],"most":[13],"successful":[14],"and":[15,69,102,161,181,329],"widely":[16],"applied":[17],"techniques":[18,150],"for":[19,39,194],"solution":[21,42],"NP-complete":[23],"problems.":[24],"The":[25],"aim":[26],"this":[28,145],"paper":[29],"is":[30,78,174,191,222,240,273,286,296,315],"to":[31,105,142,164,211,254,262,305,317],"investigate":[32],"theoretically":[33],"how":[34],"SAT":[35,120,165],"can":[36,139,258],"be":[37,106,140,260],"utilized":[38,141],"efficient":[41],"problems":[44,59,91,118,322],"that":[45,131,166,227,292,312,323],"are":[46,92],"harder":[47,107],"than":[48,108],"NP":[49,109,326],"or":[50,84,110,327],"co-NP.":[51,111],"In":[52,154,186,234],"particular,":[53,155],"we":[54,156,201,300],"consider":[55,301],"fundamental":[57],"reasoning":[58,117],"in":[60,80,85,121,168,275],"disjunctive":[62,136],"answer":[63,87],"set":[64,224],"programming":[65],"(ASP),":[66],"BRAVE":[67,160],"REASONING":[68,163],"SKEPTICA":[70],"REASONING,":[71],"which":[72,239],"ask":[73],"whether":[74],"a":[75,175,206,220,223,244,294],"given":[76],"atom":[77],"contained":[79],"at":[81,94],"least":[82],"all":[86],"sets,":[88],"respectively.":[89],"Both":[90],"located":[93],"second":[96,248],"level":[97,249],"Polynomial":[100,126,252],"Hierarchy":[101,127,253],"thus":[103,330],"assumed":[104],"One":[112],"cannot":[113],"transform":[114],"these":[115],"into":[119],"polynomial":[122,274,285],"time,":[123],"unless":[124],"collapses.":[128],"We":[129,290,310],"show":[130,291],"certain":[132],"structural":[133,176],"aspects":[134],"logic":[137],"programs":[138],"break":[143],"through":[144],"complexity":[146],"barrier,":[147],"using":[148],"new":[149],"from":[151,159,246],"Parameterized":[152],"Complexity.":[153],"exhibit":[157],"transformations":[158],"SKEPTICAL":[162],"run":[167],"time":[169,269],"$O(2^k":[170],"n^2)$":[171],"where":[172,280],"k":[173,200],"parameter":[177,195,199,264],"instance":[180],"n":[182],"input":[184,277],"size.":[185],"other":[187,319],"words,":[188],"reduction":[190,272],"fixed-parameter":[192],"tractable":[193],"k.":[196,289],"As":[197],"take":[202],"size":[204,278],"smallest":[207],"backdoor":[208,221],"with":[209,303],"respect":[210,304],"class":[213],"normal":[215],"(i.e.,":[216],"disjunction-free)":[217],"programs.":[218],"Such":[219],"atoms":[226],"when":[228,242],"deleted":[229],"makes":[230],"program":[232],"normal.":[233],"consequence,":[235],"combinatorial":[237,321],"explosion,":[238],"expected":[241],"transforming":[243],"problem":[245],"first":[256],"level,":[257],"now":[259],"confined":[261],"k,":[265],"while":[266],"running":[268],"n,":[279],"order":[282],"independent":[287],"such":[293],"transformation":[295],"not":[297],"possible":[298],"if":[299],"backdoors":[302],"tightness":[306],"instead":[307],"normality.":[309],"think":[311],"our":[313],"approach":[314],"applicable":[316],"many":[318],"hard":[320],"lie":[324],"beyond":[325],"co-NP,":[328],"significantly":[331],"enlarge":[332],"applicability":[334],"SAT.":[336]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}