{"id":"https://openalex.org/W1994520092","doi":"https://doi.org/10.1093/comjnl/bxm056","title":"Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems","display_name":"Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems","publication_year":2007,"publication_date":"2007-09-05","ids":{"openalex":"https://openalex.org/W1994520092","doi":"https://doi.org/10.1093/comjnl/bxm056","mag":"1994520092"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxm056","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm056","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"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":"The Computer Journal","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/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"G. Gottlob","raw_affiliation_strings":["Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK","Oxford University Computing Laboratory   Wolfson Building, Parks Road   Oxford OX1 3QD, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University Computing Laboratory   Wolfson Building, Parks Road   Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"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/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"S. Szeider","raw_affiliation_strings":["Department of Computer Science, Science Labs, Durham University, South Road, DH1 3LE Durham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Science Labs, Durham University, South Road, DH1 3LE Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":6.6278,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.96898654,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"51","issue":"3","first_page":"303","last_page":"325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9988999962806702,"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/T11567","display_name":"semigroups and automata theory","score":0.9988999962806702,"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.8086819648742676},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6970267295837402},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6700807809829712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.669090986251831},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5517857670783997},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.46158933639526367},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4473690390586853},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43724918365478516},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43181347846984863},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.42462050914764404},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38690394163131714},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.3865816295146942},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35198140144348145},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.20919537544250488}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8086819648742676},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6970267295837402},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6700807809829712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.669090986251831},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5517857670783997},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.46158933639526367},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4473690390586853},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43724918365478516},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43181347846984863},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.42462050914764404},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38690394163131714},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.3865816295146942},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35198140144348145},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.20919537544250488},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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":4,"locations":[{"id":"doi:10.1093/comjnl/bxm056","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm056","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"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":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.118.6477","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.6477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://comjnl.oxfordjournals.org/cgi/reprint/bxm056v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.2185","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.2185","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dur.ac.uk/stefan.szeider/papers/cj-survey.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.998.7464","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.998.7464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://comjnl.oxfordjournals.org/content/51/3/303.full.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2798276456","display_name":null,"funder_award_id":"EP/E001394/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":101,"referenced_works":["https://openalex.org/W3872339","https://openalex.org/W36639738","https://openalex.org/W52840101","https://openalex.org/W101701348","https://openalex.org/W244812768","https://openalex.org/W1509716515","https://openalex.org/W1517036688","https://openalex.org/W1518271219","https://openalex.org/W1524811847","https://openalex.org/W1555478065","https://openalex.org/W1559081432","https://openalex.org/W1559927413","https://openalex.org/W1560870503","https://openalex.org/W1562734116","https://openalex.org/W1570425181","https://openalex.org/W1570891932","https://openalex.org/W1581222813","https://openalex.org/W1667362966","https://openalex.org/W1709155369","https://openalex.org/W1752314164","https://openalex.org/W1787617900","https://openalex.org/W1884103822","https://openalex.org/W1967265779","https://openalex.org/W1969965298","https://openalex.org/W1985581502","https://openalex.org/W1992976178","https://openalex.org/W1993328543","https://openalex.org/W1995725694","https://openalex.org/W1996958432","https://openalex.org/W2001859357","https://openalex.org/W2005079828","https://openalex.org/W2008536061","https://openalex.org/W2010880586","https://openalex.org/W2014117644","https://openalex.org/W2015211698","https://openalex.org/W2019880676","https://openalex.org/W2021183451","https://openalex.org/W2026745535","https://openalex.org/W2027519504","https://openalex.org/W2027605646","https://openalex.org/W2028222220","https://openalex.org/W2031810891","https://openalex.org/W2032386524","https://openalex.org/W2034674470","https://openalex.org/W2037072284","https://openalex.org/W2040088218","https://openalex.org/W2047871605","https://openalex.org/W2048685245","https://openalex.org/W2050917944","https://openalex.org/W2057256946","https://openalex.org/W2057826895","https://openalex.org/W2058656940","https://openalex.org/W2059372025","https://openalex.org/W2063951771","https://openalex.org/W2064796716","https://openalex.org/W2066904980","https://openalex.org/W2069680070","https://openalex.org/W2070658982","https://openalex.org/W2073279331","https://openalex.org/W2080192364","https://openalex.org/W2083568285","https://openalex.org/W2085084839","https://openalex.org/W2085550081","https://openalex.org/W2087432892","https://openalex.org/W2090518395","https://openalex.org/W2090825759","https://openalex.org/W2092911568","https://openalex.org/W2100657934","https://openalex.org/W2101407539","https://openalex.org/W2102729564","https://openalex.org/W2104498537","https://openalex.org/W2105486835","https://openalex.org/W2109716789","https://openalex.org/W2111829945","https://openalex.org/W2114267503","https://openalex.org/W2120983666","https://openalex.org/W2121895052","https://openalex.org/W2123481932","https://openalex.org/W2133544949","https://openalex.org/W2139442450","https://openalex.org/W2141191281","https://openalex.org/W2143406303","https://openalex.org/W2148417962","https://openalex.org/W2150339067","https://openalex.org/W2157827214","https://openalex.org/W2158505527","https://openalex.org/W2158985358","https://openalex.org/W2159686758","https://openalex.org/W2166566648","https://openalex.org/W2169602474","https://openalex.org/W2394842790","https://openalex.org/W2401895939","https://openalex.org/W2411085520","https://openalex.org/W2506980730","https://openalex.org/W2579801771","https://openalex.org/W2913688336","https://openalex.org/W2914617426","https://openalex.org/W2945259913","https://openalex.org/W2950434194","https://openalex.org/W2986773320","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2252314269","https://openalex.org/W2161128834","https://openalex.org/W2724280655","https://openalex.org/W2906226597","https://openalex.org/W2017695771","https://openalex.org/W2295056692","https://openalex.org/W2289160775"],"abstract_inverted_index":{"We":[0],"survey":[1,43],"the":[2,24,28,37,50,53,71],"parameterized":[3,44],"complexity":[4],"of":[5,23,31,52,57,63,66,73],"problems":[6,47,65],"that":[7],"arise":[8],"in":[9,49,75],"artificial":[10],"intelligence,":[11],"database":[12,34],"theory":[13],"and":[14,36,69],"automated":[15],"reasoning.":[16],"In":[17],"particular,":[18],"we":[19,42],"consider":[20],"various":[21],"parameterizations":[22],"constraint":[25],"satisfaction":[26],"problem,":[27],"evaluation":[29],"problem":[30],"Boolean":[32],"conjunctive":[33],"queries":[35],"propositional":[38],"satisfiability":[39],"problem.":[40],"Furthermore,":[41],"algorithms":[45],"for":[46,60,70],"arising":[48],"context":[51],"stable":[54],"model":[55],"semantics":[56],"logic":[58],"programs,":[59],"a":[61],"number":[62],"other":[64],"non-monotonic":[67],"reasoning,":[68],"computation":[72],"cores":[74],"data":[76],"exchange.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":13}],"updated_date":"2026-06-23T06:36:01.041984","created_date":"2025-10-10T00:00:00"}