{"id":"https://openalex.org/W3118093767","doi":"https://doi.org/10.1093/logcom/exaa079","title":"Parameterized complexity of abduction in Schaefer\u2019s framework","display_name":"Parameterized complexity of abduction in Schaefer\u2019s framework","publication_year":2020,"publication_date":"2020-12-09","ids":{"openalex":"https://openalex.org/W3118093767","doi":"https://doi.org/10.1093/logcom/exaa079","mag":"3118093767"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exaa079","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exaa079","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","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/A5011855160","display_name":"Yasir Mahmood","orcid":"https://orcid.org/0000-0002-5651-5391"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Yasir Mahmood","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstra\u00dfe 4, 30167 Hannover, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstra\u00dfe 4, 30167 Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025571978","display_name":"Arne Meier","orcid":"https://orcid.org/0000-0002-8061-5376"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Arne Meier","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstra\u00dfe 4, 30167 Hannover, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstra\u00dfe 4, 30167 Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024018030","display_name":"Johannes Schmidt","orcid":"https://orcid.org/0000-0001-8551-1624"},"institutions":[{"id":"https://openalex.org/I94616838","display_name":"J\u00f6nk\u00f6ping University","ror":"https://ror.org/03t54am93","country_code":"SE","type":"education","lineage":["https://openalex.org/I94616838"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johannes Schmidt","raw_affiliation_strings":["Department of Computer Science and Informatics, School of Engineering, J\u00f6nk\u00f6ping University, Gjuterigatan 5, 55111, J\u00f6nk\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Informatics, School of Engineering, J\u00f6nk\u00f6ping University, Gjuterigatan 5, 55111, J\u00f6nk\u00f6ping, Sweden","institution_ids":["https://openalex.org/I94616838"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011855160"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.3091,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63242726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"31","issue":"1","first_page":"266","last_page":"296"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9973000288009644,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9342138171195984},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5662733912467957},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5597081780433655},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.43716543912887573},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.43522322177886963},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41787266731262207},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4118591547012329},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3838830888271332},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3803716003894806},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.37804844975471497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27748847007751465},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26434242725372314},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10784375667572021}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9342138171195984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5662733912467957},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5597081780433655},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43716543912887573},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.43522322177886963},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41787266731262207},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4118591547012329},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3838830888271332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3803716003894806},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.37804844975471497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27748847007751465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26434242725372314},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10784375667572021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/logcom/exaa079","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exaa079","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G938901808","display_name":null,"funder_award_id":"ME4279/1-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1536929732","https://openalex.org/W1540899940","https://openalex.org/W1542902132","https://openalex.org/W1560092834","https://openalex.org/W1570425181","https://openalex.org/W1582402643","https://openalex.org/W1589711670","https://openalex.org/W1724963320","https://openalex.org/W1772241399","https://openalex.org/W1891181203","https://openalex.org/W1967362250","https://openalex.org/W1986781756","https://openalex.org/W1994584977","https://openalex.org/W1997929764","https://openalex.org/W2029448190","https://openalex.org/W2031749383","https://openalex.org/W2033816806","https://openalex.org/W2035877205","https://openalex.org/W2055356006","https://openalex.org/W2058566227","https://openalex.org/W2082723133","https://openalex.org/W2091470957","https://openalex.org/W2100657934","https://openalex.org/W2113666441","https://openalex.org/W2114710125","https://openalex.org/W2116087731","https://openalex.org/W2125216182","https://openalex.org/W2398485441","https://openalex.org/W2404324099","https://openalex.org/W2526148662","https://openalex.org/W2531563875","https://openalex.org/W2595959570","https://openalex.org/W2951449870","https://openalex.org/W2972882235","https://openalex.org/W3102119468","https://openalex.org/W3102754027","https://openalex.org/W3184425500","https://openalex.org/W4213009134","https://openalex.org/W4292230561","https://openalex.org/W4298361041","https://openalex.org/W6633370509","https://openalex.org/W6634468986","https://openalex.org/W6638398371","https://openalex.org/W6638620360","https://openalex.org/W6644040475","https://openalex.org/W6670179993","https://openalex.org/W6673380991","https://openalex.org/W6677096025","https://openalex.org/W6678197890","https://openalex.org/W6679758622","https://openalex.org/W6684468096","https://openalex.org/W6685472585","https://openalex.org/W6712576947","https://openalex.org/W6731243836","https://openalex.org/W6886175930"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W2425261484","https://openalex.org/W189387296","https://openalex.org/W33845589","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004"],"abstract_inverted_index":{"Abstract":[0],"Abductive":[1],"reasoning":[2,57],"is":[3,86,247],"a":[4,46,67,76,92,226],"non-monotonic":[5],"formalism":[6],"stemming":[7],"from":[8],"the":[9,15,19,27,40,83,88,98,128,163,181,205,230,243,260],"work":[10],"of":[11,17,23,33,42,48,55,80,94,107,122,127,135,176,180,229,234],"Peirce.":[12],"It":[13],"describes":[14],"process":[16],"deriving":[18],"most":[20],"plausible":[21],"explanations":[22],"known":[24],"facts.":[25],"Considering":[26],"positive":[28],"version,":[29],"asking":[30],"for":[31],"sets":[32],"variables":[34],"as":[35],"explanations,":[36,49],"we":[37,74,160,224,253],"study,":[38],"besides":[39],"problem":[41,58],"wether":[43],"there":[44],"exists":[45],"set":[47],"two":[50],"explanation":[51],"size":[52,69],"limited":[53],"variants":[54],"this":[56,72,222],"(less":[59],"than":[60],"or":[61],"equal":[62,65],"to,":[63],"and":[64,97,209,237],"to":[66,250],"given":[68],"bound).":[70],"In":[71,125,178,221],"paper,":[73],"present":[75],"thorough":[77],"two-dimensional":[78],"classification":[79,166],"these":[81,108,235],"problems:":[82],"first":[84],"dimension":[85,100],"regarding":[87],"parameterized":[89,164,174,232],"complexity":[90,121,165,175],"under":[91],"wealth":[93],"different":[95],"parameterizations,":[96],"second":[99],"spans":[101],"through":[102],"all":[103],"possible":[104],"Boolean":[105],"fragments":[106],"problems":[109,236],"in":[110],"Schaefer\u2019s":[111],"constraint":[112],"satisfaction":[113],"framework":[114],"with":[115],"co-clones":[116],"(T.":[117],"J.":[118,194],"Schaefer.":[119],"The":[120],"satisfiability":[123],"problems.":[124],"Proceedings":[126,179],"10th":[129],"Annual":[130],"ACM":[131],"Symposium":[132],"on":[133,185,204],"Theory":[134],"Computing,":[136],"May":[137],"1\u20133,":[138],"1978,":[139],"San":[140],"Diego,":[141],"California,":[142],"USA,":[143],"R.J.":[144],"Lipton,":[145],"W.A.":[146],"Burkhard,":[147],"W.J.":[148],"Savitch,":[149],"E.P.":[150],"Friedman,":[151],"A.V.":[152],"Aho":[153],"eds,":[154],"pp.":[155],"216\u2013226.":[156],"ACM,":[157],"1978).":[158],"Thereby,":[159],"almost":[161],"complete":[162],"program":[167],"initiated":[168],"by":[169,207],"Fellows":[170],"et":[171],"al.":[172],"(The":[173],"abduction.":[177],"Twenty-Sixth":[182],"AAAI":[183,199],"Conference":[184],"Articial":[186],"Intelligence,":[187,217],"July":[188],"22\u201326,":[189],"2012,":[190],"Toronto,":[191],"Ontario,":[192],"Canada,":[193],"Homann,":[195],"B.":[196],"Selman":[197],"eds.":[198],"Press,":[200],"2012),":[201],"partially":[202,263],"building":[203],"results":[206],"Nordh":[208],"Zanuttini":[210],"(What":[211],"makes":[212,259],"propositional":[213],"abduction":[214],"tractable.":[215],"Artificial":[216],"172,":[218],"1245\u20131284,":[219],"2008).":[220],"process,":[223],"outline":[225],"fine-grained":[227],"analysis":[228],"inherent":[231],"intractability":[233],"pinpoint":[238],"their":[239],"FPT":[240],"parts.":[241],"As":[242],"standard":[244],"algebraic":[245,261],"approach":[246],"not":[248],"applicable":[249],"our":[251],"problems,":[252],"develop":[254],"an":[255],"alternative":[256],"method":[257],"that":[258],"tools":[262],"available":[264],"again.":[265]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}