{"id":"https://openalex.org/W3080805160","doi":"https://doi.org/10.24963/kr.2020/49","title":"Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?","display_name":"Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3080805160","doi":"https://doi.org/10.24963/kr.2020/49","mag":"3080805160"},"language":"en","primary_location":{"id":"doi:10.24963/kr.2020/49","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2020/49","pdf_url":"https://proceedings.kr.org/2020/49/kr2020-0049-hecher.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://proceedings.kr.org/2020/49/kr2020-0049-hecher.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056989280","display_name":"Markus Hecher","orcid":"https://orcid.org/0000-0003-0131-6771"},"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"]},{"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","DE"],"is_corresponding":true,"raw_author_name":"Markus Hecher","raw_affiliation_strings":["TU Wien, Vienna, Austria","University of Potsdam, Potsdam, Germany"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"University of Potsdam, Potsdam, Germany","institution_ids":["https://openalex.org/I176453806"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056989280"],"corresponding_institution_ids":["https://openalex.org/I145847075","https://openalex.org/I176453806"],"apc_list":null,"apc_paid":null,"fwci":0.9516,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8123474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"485","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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.9998000264167786,"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.9914000034332275,"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.9879999756813049,"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/treewidth","display_name":"Treewidth","score":0.9516820907592773},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.782209038734436},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.6836779713630676},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.6738517880439758},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.5584215521812439},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5462578535079956},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5097872614860535},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.48041439056396484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4760577380657196},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.46892836689949036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4557393193244934},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4528537392616272},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44261205196380615},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.433817982673645},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41476714611053467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4141283631324768},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.4100213050842285},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2789149880409241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2780226469039917},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2284550666809082},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2013731598854065},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.1636389195919037},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.15919017791748047}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9516820907592773},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.782209038734436},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.6836779713630676},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.6738517880439758},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5584215521812439},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5462578535079956},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5097872614860535},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.48041439056396484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4760577380657196},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.46892836689949036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4557393193244934},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4528537392616272},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44261205196380615},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.433817982673645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41476714611053467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4141283631324768},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.4100213050842285},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2789149880409241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2780226469039917},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2284550666809082},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2013731598854065},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.1636389195919037},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.15919017791748047},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/kr.2020/49","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2020/49","pdf_url":"https://proceedings.kr.org/2020/49/kr2020-0049-hecher.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/kr.2020/49","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2020/49","pdf_url":"https://proceedings.kr.org/2020/49/kr2020-0049-hecher.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G29884786","display_name":null,"funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G3650450984","display_name":null,"funder_award_id":"WWTF ICT19-065","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G6483656518","display_name":null,"funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7137666658","display_name":null,"funder_award_id":"Grant WWTF ICT19-065","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G8471996123","display_name":null,"funder_award_id":"WWTF ICT19-065","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8951755804","display_name":null,"funder_award_id":"P32830","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3080805160.pdf","grobid_xml":"https://content.openalex.org/works/W3080805160.grobid-xml"},"referenced_works_count":83,"referenced_works":["https://openalex.org/W74208780","https://openalex.org/W98741451","https://openalex.org/W143512583","https://openalex.org/W1487043773","https://openalex.org/W1498722751","https://openalex.org/W1503635106","https://openalex.org/W1544757461","https://openalex.org/W1567452831","https://openalex.org/W1570891932","https://openalex.org/W1585768736","https://openalex.org/W1684108869","https://openalex.org/W1766332311","https://openalex.org/W1985980194","https://openalex.org/W1995725694","https://openalex.org/W2004414305","https://openalex.org/W2010160994","https://openalex.org/W2023141722","https://openalex.org/W2025327371","https://openalex.org/W2029448190","https://openalex.org/W2050842068","https://openalex.org/W2061881283","https://openalex.org/W2076698873","https://openalex.org/W2079430756","https://openalex.org/W2087432892","https://openalex.org/W2087638517","https://openalex.org/W2091138122","https://openalex.org/W2116087731","https://openalex.org/W2126877057","https://openalex.org/W2158442970","https://openalex.org/W2194731594","https://openalex.org/W2237679549","https://openalex.org/W2293171224","https://openalex.org/W2313886575","https://openalex.org/W2397927460","https://openalex.org/W2469470624","https://openalex.org/W2490706771","https://openalex.org/W2550548770","https://openalex.org/W2555981498","https://openalex.org/W2571577684","https://openalex.org/W2591659253","https://openalex.org/W2611415697","https://openalex.org/W2617661790","https://openalex.org/W2725553666","https://openalex.org/W2783914357","https://openalex.org/W2794267717","https://openalex.org/W2804646084","https://openalex.org/W2808399616","https://openalex.org/W2810541579","https://openalex.org/W2914414140","https://openalex.org/W2924142368","https://openalex.org/W2948333530","https://openalex.org/W2953599410","https://openalex.org/W2963549629","https://openalex.org/W2966185954","https://openalex.org/W2967340447","https://openalex.org/W2974923751","https://openalex.org/W2984546510","https://openalex.org/W2998846663","https://openalex.org/W3103546459","https://openalex.org/W4206807714","https://openalex.org/W4211177236","https://openalex.org/W4214889528","https://openalex.org/W4246582195","https://openalex.org/W6604026378","https://openalex.org/W6629951148","https://openalex.org/W6634971886","https://openalex.org/W6638065767","https://openalex.org/W6656621841","https://openalex.org/W6667971289","https://openalex.org/W6668100639","https://openalex.org/W6673559633","https://openalex.org/W6677614768","https://openalex.org/W6690102345","https://openalex.org/W6699108833","https://openalex.org/W6712507762","https://openalex.org/W6731900038","https://openalex.org/W6733918949","https://openalex.org/W6737378204","https://openalex.org/W6741874119","https://openalex.org/W6750289833","https://openalex.org/W6752991255","https://openalex.org/W6760530317","https://openalex.org/W6768094241"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W1836127928","https://openalex.org/W1490290385","https://openalex.org/W1539278744","https://openalex.org/W1572255008","https://openalex.org/W1973972417","https://openalex.org/W2186377788","https://openalex.org/W2084535634","https://openalex.org/W2584271047","https://openalex.org/W1485639265"],"abstract_inverted_index":{"Answer":[0],"Set":[1],"Programming":[2],"(ASP)":[3],"is":[4,14,85,125,152,165,186,215],"a":[5,91,97,143,160,172],"paradigm":[6],"and":[7,66,75,157,208],"problem":[8],"modeling/solving":[9],"toolkit":[10],"for":[11],"KR":[12],"that":[13,151,159,176,200,209],"often":[15],"invoked.":[16],"There":[17],"are":[18],"plenty":[19],"of":[20,27,40,52,96,107,135,154,163,183,213],"results":[21],"dedicated":[22],"to":[23,59,111,121,149],"studying":[24],"the":[25,86,105,136,155,181,210],"hardness":[26],"(fragments":[28],"of)":[29],"ASP.":[30],"So":[31],"far,":[32],"these":[33],"studies":[34],"resulted":[35],"in":[36,38,46,50,78,90,104,194],"characterizations":[37],"terms":[39],"computational":[41,195],"complexity":[42,70,80],"as":[43,45],"well":[44],"fine-grained":[47],"insights":[48],"presented":[49],"form":[51],"dichotomy-style":[53],"results,":[54],"lower":[55],"bounds":[56],"when":[57,177],"translating":[58],"other":[60],"formalisms":[61],"like":[62],"propositional":[63],"satisfiability":[64],"(SAT),":[65],"even":[67],"detailed":[68],"parameterized":[69,79],"landscapes.":[71],"A":[72],"quite":[73],"generic":[74],"prominent":[76],"parameter":[77],"originating":[81],"from":[82,118,146],"graph":[83],"theory":[84],"so-called":[87],"treewidth,":[88,156,179],"which":[89],"sense":[92],"captures":[93],"structural":[94],"density":[95],"program.":[98],"Recently,":[99],"there":[100,114,124],"was":[101],"an":[102],"increase":[103,162,212],"number":[106],"treewidth-based":[108],"solvers":[109],"related":[110],"SAT.":[112],"While":[113],"exist":[115],"several":[116],"translations":[117],"(normal)":[119],"ASP":[120,148,185],"SAT,":[122],"yet":[123],"no":[126],"reduction":[127,145,202],"preserving":[128],"treewidth":[129,137,164,214],"or":[130],"at":[131],"least":[132],"being":[133],"aware":[134,153],"increase.":[138],"This":[139,197],"paper":[140],"deals":[141],"with":[142],"novel":[144],"normal":[147,184],"SAT":[150,190],"guarantees":[158],"slight":[161,211],"indeed":[166],"sufficient.":[167],"Then,":[168],"we":[169],"also":[170,198],"present":[171],"new":[173],"result":[174],"establishing":[175],"considering":[178],"already":[180],"fragment":[182],"slightly":[187],"harder":[188],"than":[189],"(under":[191],"reasonable":[192],"assumptions":[193],"complexity).":[196],"confirms":[199],"our":[201],"probably":[203],"cannot":[204],"be":[205],"significantly":[206],"improved":[207],"unavoidable.":[216]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}