{"id":"https://openalex.org/W2726628504","doi":"https://doi.org/10.3390/a14030081","title":"DynASP2.5: Dynamic Programming on Tree Decompositions in Action","display_name":"DynASP2.5: Dynamic Programming on Tree Decompositions in Action","publication_year":2021,"publication_date":"2021-03-02","ids":{"openalex":"https://openalex.org/W2726628504","doi":"https://doi.org/10.3390/a14030081","mag":"2726628504"},"language":"en","primary_location":{"id":"doi:10.3390/a14030081","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030081","pdf_url":"https://www.mdpi.com/1999-4893/14/3/81/pdf?version=1615793216","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/3/81/pdf?version=1615793216","any_repository_has_fulltext":true},"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/I4210107338","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210107338"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Johannes K. Fichte","raw_affiliation_strings":["Simons Institute for the Theory of Computing, University of California, Berkeley, CA 94720-2190, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simons Institute for the Theory of Computing, University of California, Berkeley, CA 94720-2190, USA","institution_ids":["https://openalex.org/I4210107338","https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056989280","display_name":"Markus Hecher","orcid":"https://orcid.org/0000-0003-0131-6771"},"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"]},{"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"]}],"countries":["AT","DE"],"is_corresponding":false,"raw_author_name":"Markus Hecher","raw_affiliation_strings":["Institute of Computer Science, University of Potsdam, 14482 Potsdam, Germany","Institute of Logic and Computation, TU Wien, 1040 Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Potsdam, 14482 Potsdam, Germany","institution_ids":["https://openalex.org/I176453806"]},{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, 1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050387054","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":["Institut f\u00fcr Artificial Intelligence und Cybersecurity, AAU Klagenfurt, 9020 Klagenfurt, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Artificial Intelligence und Cybersecurity, AAU Klagenfurt, 9020 Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]}]},{"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, 1040 Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0003-1594-8972","affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, 1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.1334,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.5340505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"3","first_page":"81","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9991999864578247,"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.9991999864578247,"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.9922000169754028,"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.9900000095367432,"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.7851094603538513},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7744834423065186},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7406529188156128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6907952427864075},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5699279308319092},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5337992906570435},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5034665465354919},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43437132239341736},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.41427600383758545},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3177472949028015},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31721699237823486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3079094886779785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27677279710769653},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.24716705083847046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2015020251274109},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.0785459578037262}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.7851094603538513},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7744834423065186},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7406529188156128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6907952427864075},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5699279308319092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5337992906570435},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5034665465354919},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43437132239341736},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.41427600383758545},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3177472949028015},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31721699237823486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3079094886779785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27677279710769653},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.24716705083847046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2015020251274109},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0785459578037262},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.3390/a14030081","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030081","pdf_url":"https://www.mdpi.com/1999-4893/14/3/81/pdf?version=1615793216","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1706.09370","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1706.09370","pdf_url":"https://arxiv.org/pdf/1706.09370","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"},{"id":"mag:2726628504","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1706.09370","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:doaj.org/article:b4a1cf9c1ca0478f9a2b7ab6a9d0d252","is_oa":true,"landing_page_url":"https://doaj.org/article/b4a1cf9c1ca0478f9a2b7ab6a9d0d252","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 3, p 81 (2021)","raw_type":"article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:8573","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.17","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.1706.09370","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1706.09370","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.ipec.2017.17","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2017.17","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.3390/a14030081","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030081","pdf_url":"https://www.mdpi.com/1999-4893/14/3/81/pdf?version=1615793216","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G29884786","display_name":"Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI","funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G4555480548","display_name":"HYPAR - Hybrid Parameterized Problem Solving in Practice","funder_award_id":"P 32830","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science 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/G718477789","display_name":"Extending Belief Change to Advance Dynamics in Argumentation","funder_award_id":"P30168","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"},{"id":"https://openalex.org/F4320322379","display_name":"Gottfried Wilhelm Leibniz Universit\u00e4t Hannover","ror":"https://ror.org/0304hq317"},{"id":"https://openalex.org/F4320334763","display_name":"Leibniz-Gemeinschaft","ror":"https://ror.org/01n6r0e97"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2726628504.pdf","grobid_xml":"https://content.openalex.org/works/W2726628504.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W21628717","https://openalex.org/W98741451","https://openalex.org/W165019675","https://openalex.org/W186390149","https://openalex.org/W1541340697","https://openalex.org/W1556751392","https://openalex.org/W1562038341","https://openalex.org/W1721757222","https://openalex.org/W1973101725","https://openalex.org/W1980428853","https://openalex.org/W2011124182","https://openalex.org/W2021180976","https://openalex.org/W2021183451","https://openalex.org/W2059372025","https://openalex.org/W2087432892","https://openalex.org/W2091138122","https://openalex.org/W2180068027","https://openalex.org/W2205514811","https://openalex.org/W2397927460","https://openalex.org/W2401610261","https://openalex.org/W2499916382","https://openalex.org/W2505202112","https://openalex.org/W2551391766","https://openalex.org/W2576170812","https://openalex.org/W2591659253","https://openalex.org/W2594402149","https://openalex.org/W2609269940","https://openalex.org/W2617661790","https://openalex.org/W2794267717","https://openalex.org/W2795456052","https://openalex.org/W2902960646","https://openalex.org/W2924142368","https://openalex.org/W2953599410","https://openalex.org/W2963886128","https://openalex.org/W2984546510","https://openalex.org/W2996917877","https://openalex.org/W2997686574","https://openalex.org/W2998846663","https://openalex.org/W3040346023","https://openalex.org/W3080805160","https://openalex.org/W3174909990","https://openalex.org/W4213368513","https://openalex.org/W4232896595","https://openalex.org/W4297941663","https://openalex.org/W6604026378","https://openalex.org/W6634971886","https://openalex.org/W6712507762","https://openalex.org/W6729563227","https://openalex.org/W6750289833","https://openalex.org/W6778149281","https://openalex.org/W6959232126"],"related_works":["https://openalex.org/W2963867061","https://openalex.org/W2914414140","https://openalex.org/W2591659253","https://openalex.org/W3099669149","https://openalex.org/W2567000106","https://openalex.org/W2963406506","https://openalex.org/W2406975053","https://openalex.org/W3130512362","https://openalex.org/W58471491","https://openalex.org/W3190349335","https://openalex.org/W2588296545","https://openalex.org/W2903626267","https://openalex.org/W2265416015","https://openalex.org/W3040346023","https://openalex.org/W2101585749","https://openalex.org/W98741451","https://openalex.org/W2116087731","https://openalex.org/W2021180976","https://openalex.org/W1595443289","https://openalex.org/W2185085875"],"abstract_inverted_index":{"Efficient":[0],"exact":[1],"parameterized":[2,35,104],"algorithms":[3,10,90,105],"are":[4,192,311],"an":[5,129,145,202,205],"active":[6],"research":[7],"area.":[8],"Such":[9],"exhibit":[11],"a":[12,152,181,329,380],"broad":[13],"interest":[14],"in":[15,34,71],"the":[16,20,54,66,72,121,135,197,212,216,266,324,365,391,395,406],"theoretical":[17,77,136,291],"community.":[18],"In":[19,49,94,164,316,390],"last":[21],"few":[22],"years,":[23],"implementations":[24,102],"for":[25,52,158,189,343],"computing":[26],"various":[27],"parameters":[28],"(parameter":[29],"detection)":[30],"have":[31],"been":[32],"established":[33],"challenges,":[36],"such":[37,75,106,268],"as":[38,225],"treewidth,":[39,373],"treedepth,":[40],"hypertree":[41],"width,":[42],"feedback":[43],"vertex":[44,47],"set,":[45],"or":[46,111],"cover.":[48],"theory,":[50],"instances,":[51,362],"which":[53,154,179,327,363],"considered":[55],"parameter":[56,122,226],"is":[57,68,81,123,155,180,208,234,242,377],"small,":[58],"can":[59,86,97,127,250,264,302,354],"be":[60,143],"solved":[61],"fast":[62,243,276],"(problem":[63],"evaluation),":[64],"i.e.,":[65],"runtime":[67],"bounded":[69],"exponential":[70],"parameter.":[73],"While":[74],"favorable":[76],"guarantees":[78],"exists,":[79],"it":[80,139,270],"often":[82,156],"unclear":[83],"whether":[84,201,262],"one":[85,170,255,263,273,346,353],"successfully":[87],"implement":[88],"these":[89,300],"under":[91,134],"practical":[92],"considerations.":[93],"other":[95],"words,":[96],"we":[98,126,167,319,384,393,403],"design":[99],"and":[100,185,227,249,277,322,402],"construct":[101,323],"of":[103,151,174,199,215,246,287,293,305,398],"that":[107,131,144,160,222,239,269,299,356,383],"they":[108,310],"perform":[109],"similar":[110],"even":[112,342],"better":[113],"than":[114],"well-established":[115],"problem":[116,198,368],"solvers":[117,159,284,296,301,341],"on":[118,162,211,231,244,285,313,369,379],"instances":[119,173,191,245,286,304],"where":[120,352],"small.":[124],"Indeed,":[125],"build":[128,161],"implementation":[130,359,376,400],"performs":[132],"well":[133,142],"assumptions.":[137],"However,":[138],"could":[140],"also":[141,271],"existing":[146],"solver":[147,221,241,267,325,334],"implicitly":[148],"takes":[149],"advantage":[150],"structure,":[153],"claimed":[157],"Sat-solving.":[163],"this":[165,240,317],"paper,":[166,318,392],"consider":[168],"finding":[169,344],"solution":[171],"to":[172,281,338],"answer":[175,194,206,257,274],"set":[176,207,275],"programming":[177,230,388],"(ASP),":[178],"logic-based":[182],"declarative":[183],"modeling":[184],"solving":[186],"framework.":[187],"Solutions":[188],"ASP":[190,220,253,283,295,340,361],"so-called":[193],"sets.":[195,258],"Interestingly,":[196],"deciding":[200],"instance":[203],"has":[204],"already":[209,297],"located":[210],"second":[213],"level":[214],"polynomial":[217],"hierarchy.":[218],"An":[219],"employs":[223],"treewidth":[224,248,307],"runs":[228],"dynamic":[229,387],"tree":[232,367],"decompositions":[233],"DynASP2.":[235],"Empirical":[236],"experiments":[237,351],"show":[238],"small":[247],"outperform":[251],"modern":[252,282,294],"when":[254],"counts":[256],"It":[259],"remains":[260],"open,":[261],"improve":[265,320],"finds":[272],"shows":[278,335],"competitive":[279,336],"behavior":[280,337],"low":[288,306,372],"treewidth.":[289],"Unfortunately,":[290],"models":[292],"indicate":[298],"solve":[303],"fast,":[308],"since":[309],"based":[312,378],"Sat-solving":[314],"algorithms.":[315,411],"DynASP2":[321],"DynASP2.5,":[326],"uses":[328],"different":[330],"approach.":[331],"The":[332],"new":[333,358],"state-of-the-art":[339],"just":[345],"solution.":[347],"We":[348],"present":[349],"empirical":[350],"see":[355],"our":[357,399],"solves":[360],"encode":[364],"Steiner":[366],"graphs":[370],"with":[371],"fast.":[374],"Our":[375],"novel":[381],"approach":[382],"call":[385],"multi-pass":[386],"(M-DPSINC).":[389],"describe":[394],"underlying":[396],"concepts":[397],"(DynASP2.5)":[401],"argue":[404],"why":[405],"techniques":[407],"still":[408],"yield":[409],"correct":[410]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}