{"id":"https://openalex.org/W2157678272","doi":"https://doi.org/10.1017/s1471068412000129","title":"D-FLAT: Declarative problem solving using tree decompositions and answer-set programming","display_name":"D-FLAT: Declarative problem solving using tree decompositions and answer-set programming","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2157678272","doi":"https://doi.org/10.1017/s1471068412000129","mag":"2157678272"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068412000129","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068412000129","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":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071014536","display_name":"Bernhard Bliem","orcid":"https://orcid.org/0000-0002-2898-2830"},"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":"BERNHARD BLIEM","raw_affiliation_strings":["Institute of Information Systems 184/2 Vienna University of Technology Favoritenstrasse 9\u201311, 1040 Vienna, Austria (e-mail:"],"affiliations":[{"raw_affiliation_string":"Institute of Information Systems 184/2 Vienna University of Technology Favoritenstrasse 9\u201311, 1040 Vienna, Austria (e-mail:","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/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":"MICHAEL MORAK","raw_affiliation_strings":["Institute of Information Systems 184/2 Vienna University of Technology Favoritenstrasse 9\u201311, 1040 Vienna, Austria (e-mail:"],"affiliations":[{"raw_affiliation_string":"Institute of Information Systems 184/2 Vienna University of Technology Favoritenstrasse 9\u201311, 1040 Vienna, Austria (e-mail:","institution_ids":["https://openalex.org/I145847075"]}]},{"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 Information Systems 184/2 Vienna University of Technology Favoritenstrasse 9\u201311, 1040 Vienna, Austria (e-mail:"],"affiliations":[{"raw_affiliation_string":"Institute of Information Systems 184/2 Vienna University of Technology Favoritenstrasse 9\u201311, 1040 Vienna, Austria (e-mail:","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071014536"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":3.8531,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.93715192,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"4-5","first_page":"445","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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.9962999820709229,"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.9925000071525574,"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.8701775074005127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8453480005264282},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6168203949928284},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.592927873134613},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.5702455639839172},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5095736980438232},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5060626864433289},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4950486719608307},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.47488707304000854},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.418012797832489},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3970339596271515},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.3885958194732666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.353502094745636},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.3280661702156067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09759268164634705}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8701775074005127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8453480005264282},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6168203949928284},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.592927873134613},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.5702455639839172},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5095736980438232},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5060626864433289},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4950486719608307},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.47488707304000854},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.418012797832489},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3970339596271515},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.3885958194732666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.353502094745636},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3280661702156067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09759268164634705},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068412000129","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068412000129","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W98741451","https://openalex.org/W165195483","https://openalex.org/W1482532598","https://openalex.org/W1527664624","https://openalex.org/W1639901403","https://openalex.org/W1772789695","https://openalex.org/W1804601140","https://openalex.org/W1830683714","https://openalex.org/W1974817955","https://openalex.org/W1976055110","https://openalex.org/W2000409628","https://openalex.org/W2000648551","https://openalex.org/W2002722727","https://openalex.org/W2016416699","https://openalex.org/W2021180976","https://openalex.org/W2033325972","https://openalex.org/W2076698873","https://openalex.org/W2076932243","https://openalex.org/W2080959483","https://openalex.org/W2082232766","https://openalex.org/W2091138122","https://openalex.org/W2116793595","https://openalex.org/W2146325624","https://openalex.org/W2152131859","https://openalex.org/W2155683758","https://openalex.org/W2159003936","https://openalex.org/W2341171179","https://openalex.org/W2343532609","https://openalex.org/W2531826319","https://openalex.org/W2605194663","https://openalex.org/W2886271628","https://openalex.org/W2914617426","https://openalex.org/W2984546510","https://openalex.org/W2986773320","https://openalex.org/W4251197763","https://openalex.org/W4256177187","https://openalex.org/W6683227944"],"related_works":["https://openalex.org/W2174399230","https://openalex.org/W150122547","https://openalex.org/W2161156675","https://openalex.org/W2603393869","https://openalex.org/W1644865499","https://openalex.org/W2169841379","https://openalex.org/W2438481272","https://openalex.org/W4296878212","https://openalex.org/W2039406101","https://openalex.org/W2172209430"],"abstract_inverted_index":{"Abstract":[0],"In":[1,23,72,139],"this":[2,73],"work,":[3],"we":[4,75,142,161],"propose":[5],"Answer-Set":[6],"Programming":[7],"(ASP)":[8],"as":[9],"a":[10,33,57,78,144],"tool":[11,80],"for":[12,65,170],"rapid":[13],"prototyping":[14],"of":[15,35,48,55,68,85,100,150,157,179],"dynamic":[16,69,109,136],"programming":[17,70,110,137],"algorithms":[18,27],"based":[19],"on":[20,177],"tree":[21,58,96],"decompositions.":[22],"fact,":[24],"many":[25],"such":[26],"have":[28],"been":[29],"designed,":[30],"but":[31],"only":[32,107],"few":[34,145],"them":[36],"found":[37],"their":[38],"way":[39],"into":[40],"implementation.":[41],"The":[42],"main":[43,155],"obstacle":[44],"is":[45,106],"the":[46,83,90,98,108,119,131,135,140,148,154,158],"lack":[47],"easy-to-use":[49],"systems":[50],"which":[51,113,164],"(i)":[52],"take":[53],"care":[54],"building":[56],"decomposition":[59],"and":[60,152],"(ii)":[61],"provide":[62],"an":[63,124],"interface":[64],"declarative":[66],"specifications":[67],"algorithms.":[71],"paper,":[74,141],"present":[76],"D-FLAT,":[77],"novel":[79],"that":[81,166],"relieves":[82],"user":[84],"having":[86],"to":[87,115,129],"handle":[88],"all":[89],"technical":[91],"details":[92],"concerned":[93],"with":[94],"parsing,":[95],"decomposition,":[97],"handling":[99],"data":[101],"structures,":[102],"etc.":[103],"Instead,":[104],"it":[105],"algorithm":[111],"itself":[112],"has":[114],"be":[116],"specified":[117],"in":[118,127,134],"ASP":[120,125,175],"language.":[121],"D-FLAT":[122,151,168],"employs":[123],"solver":[126],"order":[128],"compute":[130],"local":[132],"solutions":[133],"algorithm.":[138],"give":[143],"examples":[146],"illustrating":[147],"use":[149],"describe":[153],"features":[156],"system.":[159],"Moreover,":[160],"report":[162],"experiments":[163],"show":[165],"ASP-based":[167],"encodings":[169,176],"some":[171],"problems":[172],"outperform":[173],"monolithic":[174],"instances":[178],"small":[180],"treewidth.":[181]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}