Fixed-parameter complexity in AI and nonmonotonic reasoning

Many relevant intractable problems become tractable if some problem parameter is fixed. However, various problems exhibit very different computational properties, depending on how the runtime required for solving them is related to the fixed parameter chosen. The theory of parameterized complexity d...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Artificial intelligence Ročník 138; číslo 1; s. 55 - 86
Hlavní autoři:	Gottlob, Georg, Scarcello, Francesco, Sideri, Martha
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.06.2002
Témata:	Artificial intelligence Circumscription Conjunctive queries Constraint satisfaction Fixed-parameter tractability Knowledge representation Logic programming Nonmonotonic reasoning Parameterized complexity Prime implicants Stable models Logic programming Nonmonotonic reasoning Constraint satisfaction Stable models Prime implicants Fixed-parameter tractability Parameterized complexity Conjunctive queries Circumscription
ISSN:	0004-3702, 1872-7921
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Many relevant intractable problems become tractable if some problem parameter is fixed. However, various problems exhibit very different computational properties, depending on how the runtime required for solving them is related to the fixed parameter chosen. The theory of parameterized complexity deals with such issues, and provides general techniques for identifying fixed-parameter tractable and fixed-parameter intractable problems. We study the parameterized complexity of various problems in AI and nonmonotonic reasoning. We show that a number of relevant parameterized problems in these areas are fixed-parameter tractable. Among these problems are constraint satisfaction problems with bounded treewidth and fixed domain, restricted forms of conjunctive database queries, restricted satisfiability problems, propositional logic programming under the stable model semantics where the parameter is the dimension of a feedback vertex set of the program's dependency graph, and circumscriptive inference from a positive k-CNF restricted to models of bounded size. We also show that circumscriptive inference from a general propositional theory, when the attention is restricted to models of bounded size, is fixed-parameter intractable and is actually complete for a novel fixed-parameter complexity class.
AbstractList	Article included in a special issue devoted to the theme: Knowledge presentation and logic programming. Many relevant intractable problems become tractable if some problem parameter is fixed. However, various problems exhibit very different computational properties, depending on how the runtime required for solving them is related to the fixed parameter chosen. The theory of parameterized complexity deals with such issues, and provides general techniques for identifying fixed-parameter tractable and fixed-parameter intractable problems. Describes a study of the parameterized complexity of various problems in artificial intelligence and non monotonic reasoning. Shows that a number of relevant parameterized problems in these areas are fixed parameter tractable. Among these problems are constraint satisfaction problems with bounded treewidth and fixed domain, restricted forms of conjunctive database queries, restricted satisfiability problems, propositional logic programming under the stable model semantics where the parameter is the dimension of a feedback vertex set of the program's dependency graph, and circumscriptive inference from a positive k-CNF restricted to models of bounded size. (Original abstract - amended) Many relevant intractable problems become tractable if some problem parameter is fixed. However, various problems exhibit very different computational properties, depending on how the runtime required for solving them is related to the fixed parameter chosen. The theory of parameterized complexity deals with such issues, and provides general techniques for identifying fixed-parameter tractable and fixed-parameter intractable problems. We study the parameterized complexity of various problems in AI and nonmonotonic reasoning. We show that a number of relevant parameterized problems in these areas are fixed-parameter tractable. Among these problems are constraint satisfaction problems with bounded treewidth and fixed domain, restricted forms of conjunctive database queries, restricted satisfiability problems, propositional logic programming under the stable model semantics where the parameter is the dimension of a feedback vertex set of the program's dependency graph, and circumscriptive inference from a positive k-CNF restricted to models of bounded size. We also show that circumscriptive inference from a general propositional theory, when the attention is restricted to models of bounded size, is fixed-parameter intractable and is actually complete for a novel fixed-parameter complexity class.
Author	Gottlob, Georg Scarcello, Francesco Sideri, Martha
Author_xml	– sequence: 1 givenname: Georg surname: Gottlob fullname: Gottlob, Georg email: gottlob@dbai.tuwien.ac.at organization: Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria – sequence: 2 givenname: Francesco surname: Scarcello fullname: Scarcello, Francesco email: scarcello@deis.unical.it organization: Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, I-87036 Rende (CS), Italy – sequence: 3 givenname: Martha surname: Sideri fullname: Sideri, Martha email: sideri@aueb.gr organization: Department of Informatics, Athens University of Economics and Business, GR-10434 Athens, Greece
BookMark	eNqFkM1KAzEUhYNUsK0-gjAr0cVoMmkmDV1IKVYLBRfqOmSSOxKZSWqSSvv2zlhx4aZw4f5wzrnwjdDAeQcIXRJ8SzAp714wxpOcclxc4-IGYzItcnyChmTKi5yLggzQ8E9yhkYxfnQrFYIM0Wxpd2DyjQqqhQQh077dNLCzaZ9Zl81XmXIm6x623vnkndVZABW7wb2fo9NaNREufvsYvS0fXhdP-fr5cbWYr3NdMJryktVMaMYqMdVQKjDAhVAUDK_LiaprDhVnhoIgrLvUqqy40bQSTIPAglA6RleH3E3wn1uISbY2amga5cBvo2ScEUEp7oSzg1AHH2OAWmqbVLLepaBsIwmWPTD5A0z2NGRfPTDZu9k_9ybYVoX9Ud_9wQcdgy8LQUZtwWkwNoBO0nh7JOEb82iFNg
CitedBy_id	crossref_primary_10_1007_s11390_009_9285_5 crossref_primary_10_1016_j_tcs_2012_11_038 crossref_primary_10_1145_3655024 crossref_primary_10_1016_j_artint_2014_12_001 crossref_primary_10_1016_j_tcs_2017_09_024 crossref_primary_10_1145_3725251 crossref_primary_10_1016_j_tcs_2017_09_027 crossref_primary_10_1007_s11390_007_9071_1 crossref_primary_10_1016_j_artint_2007_03_006 crossref_primary_10_1007_s00153_015_0435_x crossref_primary_10_1016_j_artint_2025_104322 crossref_primary_10_1016_j_jcss_2017_02_002 crossref_primary_10_1016_j_ipl_2018_03_016 crossref_primary_10_1080_13562576_2021_1985868 crossref_primary_10_1007_s00224_009_9248_9 crossref_primary_10_1016_j_artint_2009_06_005 crossref_primary_10_1016_j_tcs_2018_06_027 crossref_primary_10_1016_j_artint_2014_06_006 crossref_primary_10_1007_s10817_007_9074_1 crossref_primary_10_1016_j_jcss_2009_04_003 crossref_primary_10_1016_j_jcss_2004_04_009 crossref_primary_10_1016_j_artint_2023_103880 crossref_primary_10_1016_j_artint_2021_103460 crossref_primary_10_1016_j_jda_2009_06_002 crossref_primary_10_1007_s10472_019_09633_x crossref_primary_10_1145_1284320_1284323 crossref_primary_10_1007_s00236_007_0056_x crossref_primary_10_1016_S0004_3702_02_00207_2 crossref_primary_10_1145_2535926 crossref_primary_10_1016_j_tcs_2016_06_012 crossref_primary_10_1016_j_artint_2012_08_005 crossref_primary_10_3390_a14030081
Cites_doi	10.1016/0196-6774(86)90023-4 10.1016/0004-3702(88)90023-9 10.1016/0304-3975(80)90009-2 10.1016/0004-3702(89)90037-4 10.1016/0004-3702(93)90171-7 10.1016/0304-3975(93)90073-3 10.1145/263867.263489 10.1016/0004-3702(87)90062-2 10.1137/S0097539792228228 10.1016/S0743-1066(98)10020-1 10.1145/4221.4225 10.4064/fm-10-1-96-115 10.1016/S0004-3702(00)00078-3 10.1023/A:1018971231561 10.1137/S0097539793251219 10.1145/2402.322389
ContentType	Journal Article
Copyright	2002 Elsevier Science B.V.
Copyright_xml	– notice: 2002 Elsevier Science B.V.
DBID	6I. AAFTH AAYXX CITATION E3H F2A
DOI	10.1016/S0004-3702(02)00182-0
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Library & Information Sciences Abstracts (LISA) Library & Information Science Abstracts (LISA)
DatabaseTitle	CrossRef Library and Information Science Abstracts (LISA)
DatabaseTitleList	Library and Information Science Abstracts (LISA)
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1872-7921
EndPage	86
ExternalDocumentID	10_1016_S0004_3702_02_00182_0 S0004370202001820
GroupedDBID	--K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6I. 6J9 6TJ 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACWUS ACZNC ADBBV ADEZE ADMUD AEBSH AECPX AEFWE AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM KQ8 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL VQA WH7 WUQ XFK XJE XJT XPP XSW ZMT ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD E3H F2A
ID	FETCH-LOGICAL-c253t-65f59c55b98ce6aede799a3ed7f64aff7eb75d3e9157f6fa6b7dc3b95ce909133
ISSN	0004-3702
IngestDate	Sun Sep 28 02:49:13 EDT 2025 Sat Nov 29 05:28:55 EST 2025 Tue Nov 18 21:56:40 EST 2025 Fri Feb 23 02:27:15 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Logic programming Nonmonotonic reasoning Constraint satisfaction Stable models Prime implicants Fixed-parameter tractability Parameterized complexity Conjunctive queries Circumscription
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c253t-65f59c55b98ce6aede799a3ed7f64aff7eb75d3e9157f6fa6b7dc3b95ce909133
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
OpenAccessLink	https://dx.doi.org/10.1016/S0004-3702(02)00182-0
PQID	57519330
PQPubID	23477
PageCount	32
ParticipantIDs	proquest_miscellaneous_57519330 crossref_citationtrail_10_1016_S0004_3702_02_00182_0 crossref_primary_10_1016_S0004_3702_02_00182_0 elsevier_sciencedirect_doi_10_1016_S0004_3702_02_00182_0
PublicationCentury	2000
PublicationDate	2002-06-00
PublicationDateYYYYMMDD	2002-06-01
PublicationDate_xml	– month: 06 year: 2002 text: 2002-06-00
PublicationDecade	2000
PublicationTitle	Artificial intelligence
PublicationYear	2002
Publisher	Elsevier B.V
Publisher_xml	– name: Elsevier B.V
References	Downey, Fellows (BIB012) 1995; 24 Bibel (BIB003) 1988; 35 Bodlaender (BIB004) 1996; 25 Cadoli, Palopoli, Scarcello (BIB005) 1999; 27 Gelfond, Lifschitz (BIB024) 1988 Garey, Johnson (BIB023) 1979 Menger (BIB032) 1927; 10 Downey, Fellows (BIB013) 1996 Eiter, Gottlob (BIB015) 1993; 114 Yannakakis (BIB041) 1981 Jeavons, Cohen, Gyssens (BIB028) 1997; 44 Even (BIB018) 1979 Niemelä, Simons (BIB034) 1997; 1265 Cholewiński, Truszczyński (BIB006) 1999; 38 Eiter, Faber, Leone, Pfeifer (BIB017) 2000 Beeri, Fagin, Maier, Yannakakis (BIB002) 1983; 30 Apt, Blair, Walker (BIB001) 1988 Truszczyński (BIB039) 1999 Downey, Fellows (BIB014) 1999 Eiter, Leone, Mateis, Pfeifer, Scarcello (BIB016) 1998 J. Flum, M. Grohe, Fixed-parameter tractability and logic, Preprint Nr. 23/1999, Mathematische Fakultät, University of Freiburg, Freiburg, Germany, 1999 Fortune, Hopcroft, Wyllie (BIB021) 1980; 10 Marek, Truszczyński (BIB031) 1993 Downey, Fellows (BIB011) 1992 Kolaitis, Vardi (BIB029) 1998 Dechter (BIB007) 1992 Grohe (BIB027) 1999; 1683 Faber, Leone, Pfeifer (BIB019) 1999; 1730 Niemelä, Simons, Soininen (BIB033) 1999; 1730 Reiter (BIB037) 1987; 32 de Kleer (BIB009) 1993; 59 Vardi (BIB040) 1982 Dechter, Pearl (BIB008) 1989; 38 Freuder (BIB022) 1985; 32 Papadimitriou, Yannakakis (BIB035) 1997 Gottlob, Leone, Scarcello (BIB026) 2000; 124 Downey, Fellows (BIB010) 1992; 87 J. Pearson, P.G. Jeavons, A survey of tractable constraint satisfaction problems, CSD-TR-97-15, Royal Holloway, Univ. of London, 1997 G. Gottlob, N. Leone, F. Scarcello, The complexity of acyclic conjunctive queries, J. ACM 48 (3) (2001) 431–498. An extended abstract concerning part of this work has been published in: Proc. IEEE Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, CA, 1998, pp. 706–715 Maier (BIB030) 1986 Robertson, Seymour (BIB038) 1986; 7 Eiter (10.1016/S0004-3702(02)00182-0_BIB016) 1998 Niemelä (10.1016/S0004-3702(02)00182-0_BIB034) 1997; 1265 Cholewiński (10.1016/S0004-3702(02)00182-0_BIB006) 1999; 38 Even (10.1016/S0004-3702(02)00182-0_BIB018) 1979 Downey (10.1016/S0004-3702(02)00182-0_BIB013) 1996 Grohe (10.1016/S0004-3702(02)00182-0_BIB027) 1999; 1683 Downey (10.1016/S0004-3702(02)00182-0_BIB010) 1992; 87 Beeri (10.1016/S0004-3702(02)00182-0_BIB002) 1983; 30 Dechter (10.1016/S0004-3702(02)00182-0_BIB008) 1989; 38 Downey (10.1016/S0004-3702(02)00182-0_BIB012) 1995; 24 Garey (10.1016/S0004-3702(02)00182-0_BIB023) 1979 Eiter (10.1016/S0004-3702(02)00182-0_BIB017) 2000 Robertson (10.1016/S0004-3702(02)00182-0_BIB038) 1986; 7 Menger (10.1016/S0004-3702(02)00182-0_BIB032) 1927; 10 Downey (10.1016/S0004-3702(02)00182-0_BIB011) 1992 Fortune (10.1016/S0004-3702(02)00182-0_BIB021) 1980; 10 Vardi (10.1016/S0004-3702(02)00182-0_BIB040) 1982 Bodlaender (10.1016/S0004-3702(02)00182-0_BIB004) 1996; 25 Dechter (10.1016/S0004-3702(02)00182-0_BIB007) 1992 10.1016/S0004-3702(02)00182-0_BIB025 Papadimitriou (10.1016/S0004-3702(02)00182-0_BIB035) 1997 Yannakakis (10.1016/S0004-3702(02)00182-0_BIB041) 1981 10.1016/S0004-3702(02)00182-0_BIB020 Eiter (10.1016/S0004-3702(02)00182-0_BIB015) 1993; 114 Freuder (10.1016/S0004-3702(02)00182-0_BIB022) 1985; 32 Kolaitis (10.1016/S0004-3702(02)00182-0_BIB029) 1998 Downey (10.1016/S0004-3702(02)00182-0_BIB014) 1999 Marek (10.1016/S0004-3702(02)00182-0_BIB031) 1993 de Kleer (10.1016/S0004-3702(02)00182-0_BIB009) 1993; 59 Gelfond (10.1016/S0004-3702(02)00182-0_BIB024) 1988 Cadoli (10.1016/S0004-3702(02)00182-0_BIB005) 1999; 27 Apt (10.1016/S0004-3702(02)00182-0_BIB001) 1988 Gottlob (10.1016/S0004-3702(02)00182-0_BIB026) 2000; 124 Niemelä (10.1016/S0004-3702(02)00182-0_BIB033) 1999; 1730 Bibel (10.1016/S0004-3702(02)00182-0_BIB003) 1988; 35 Jeavons (10.1016/S0004-3702(02)00182-0_BIB028) 1997; 44 Faber (10.1016/S0004-3702(02)00182-0_BIB019) 1999; 1730 Truszczyński (10.1016/S0004-3702(02)00182-0_BIB039) 1999 Maier (10.1016/S0004-3702(02)00182-0_BIB030) 1986 Reiter (10.1016/S0004-3702(02)00182-0_BIB037) 1987; 32 10.1016/S0004-3702(02)00182-0_BIB036
References_xml	– volume: 124 start-page: 243 year: 2000 end-page: 282 ident: BIB026 article-title: A comparison of structural CSP decomposition methods publication-title: Artificial Intelligence – volume: 10 start-page: 96 year: 1927 end-page: 115 ident: BIB032 article-title: Zur allgemeinen Kurventheorie publication-title: Fund. Math. – year: 1999 ident: BIB014 publication-title: Parameterized Complexity – start-page: 406 year: 1998 end-page: 417 ident: BIB016 article-title: The KR system publication-title: Proc. Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Trento, Italy – volume: 38 start-page: 219 year: 1999 end-page: 242 ident: BIB006 article-title: Extremal problems in logic programming and stable model computation publication-title: J. Logic Programming – start-page: 169 year: 1999 end-page: 183 ident: BIB039 article-title: Computing large and small stable models publication-title: Proc. 16th International Conference on Logic Programming (ICLP'99), Las Cruces, NM – volume: 87 start-page: 161 year: 1992 end-page: 187 ident: BIB010 article-title: Fixed parameter tractability and completeness publication-title: Congr. Numer. – volume: 1730 start-page: 317 year: 1999 end-page: 331 ident: BIB033 article-title: Stable model semantics of weight constraint rules publication-title: Proc. 5th International Conference on Logic Programming Nonmonotonic Reasoning (LPNMR'99), El Paso, TX – volume: 114 start-page: 231 year: 1993 end-page: 245 ident: BIB015 article-title: Propositional circumscription and extended closed world reasoning are publication-title: Theoret. Comput. Sci. – year: 1993 ident: BIB031 publication-title: Nonmonotonic Logics—Context-Dependent Reasoning – volume: 35 start-page: 401 year: 1988 end-page: 413 ident: BIB003 article-title: Constraint satisfaction from a deductive viewpoint publication-title: Artificial Intelligence – volume: 59 start-page: 63 year: 1993 end-page: 67 ident: BIB009 article-title: A perspective on assumption-based truth maintenance publication-title: Artificial Intelligence – start-page: 1070 year: 1988 end-page: 1080 ident: BIB024 article-title: The stable model semantics for logic programming publication-title: Logic Programming: Proc. Fifth Internat. Conference Symposium – start-page: 12 year: 1997 end-page: 19 ident: BIB035 article-title: On the complexity of database queries publication-title: Proc. of Symp. on Principles of Database Systems (PODS'97), Tucson, AZ – volume: 1683 start-page: 264 year: 1999 end-page: 273 ident: BIB027 article-title: Descriptive and parametrized complexity publication-title: Proc. 13th International Workshop on Computer Science Logic (CSL'99) – volume: 32 start-page: 57 year: 1987 end-page: 95 ident: BIB037 article-title: A theory of diagnosis from first principles publication-title: Artificial Intelligence – start-page: 89 year: 1988 end-page: 148 ident: BIB001 article-title: Towards a theory of declarative knowledge publication-title: Foundations of Deductive Databases and Logic Programming – year: 2000 ident: BIB017 article-title: Declarative problem-solving using the DLV system publication-title: Logic-Based Artificial Intelligence – volume: 30 start-page: 479 year: 1983 end-page: 513 ident: BIB002 article-title: On the desirability of acyclic database schemes publication-title: J. ACM – reference: G. Gottlob, N. Leone, F. Scarcello, The complexity of acyclic conjunctive queries, J. ACM 48 (3) (2001) 431–498. An extended abstract concerning part of this work has been published in: Proc. IEEE Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, CA, 1998, pp. 706–715 – volume: 25 start-page: 1305 year: 1996 end-page: 1317 ident: BIB004 article-title: A linear-time algorithm for finding tree-decompositions of small treewidth publication-title: SIAM J. Comput. – volume: 1730 start-page: 177 year: 1999 end-page: 191 ident: BIB019 article-title: Pushing goal derivation in DLP computations publication-title: Proc. 5th International Conference on Logic Programming Nonmonotonic Reasoning (LPNMR'99), El Paso, TX – reference: J. Pearson, P.G. Jeavons, A survey of tractable constraint satisfaction problems, CSD-TR-97-15, Royal Holloway, Univ. of London, 1997 – start-page: 36 year: 1992 end-page: 49 ident: BIB011 article-title: Fixed parameter intractability (extended abstract) publication-title: Proc. 7th Annual Structure in Complexity Theory Conference, Boston, MA – start-page: 205 year: 1998 end-page: 213 ident: BIB029 article-title: Conjunctive-query containment and constraint satisfaction publication-title: Proc. of Symposium on Principles of Database Systems (PODS'98) – volume: 27 start-page: 129 year: 1999 end-page: 148 ident: BIB005 article-title: Propositional lower bounds: Generalization and algorithms publication-title: Ann. Math. Artif. Intell. – volume: 44 start-page: 527 year: 1997 end-page: 548 ident: BIB028 article-title: Closure properties of constraints publication-title: J. ACM – year: 1986 ident: BIB030 publication-title: The Theory of Relational Databases – year: 1979 ident: BIB018 publication-title: Graph Algorithms – start-page: 82 year: 1981 end-page: 94 ident: BIB041 article-title: Algorithms for acyclic database schemes publication-title: Proc. Internat. Conference on Very Large Data Bases (VLDB'81), Cannes, France – start-page: 276 year: 1992 end-page: 285 ident: BIB007 article-title: Constraint networks publication-title: Encyclopedia of Artificial Intelligence – volume: 38 start-page: 353 year: 1989 end-page: 366 ident: BIB008 article-title: Tree clustering for constraint networks publication-title: Artificial Intelligence – volume: 24 start-page: 873 year: 1995 end-page: 921 ident: BIB012 article-title: Fixed parameter tractability and completeness I: Basic results publication-title: SIAM J. Comput. – year: 1979 ident: BIB023 publication-title: Computers and Intractability. A Guide to the Theory of NP-completeness – volume: 32 start-page: 755 year: 1985 end-page: 761 ident: BIB022 article-title: A sufficient condition for backtrack-bounded search publication-title: J. ACM – volume: 10 start-page: 111 year: 1980 end-page: 121 ident: BIB021 article-title: The directed subgraph homeomorphism problem publication-title: Theoret. Comput. Sci. – reference: J. Flum, M. Grohe, Fixed-parameter tractability and logic, Preprint Nr. 23/1999, Mathematische Fakultät, University of Freiburg, Freiburg, Germany, 1999 – volume: 1265 start-page: 421 year: 1997 end-page: 430 ident: BIB034 article-title: Smodels—An implementation of the stable model and well-founded semantics for normal LP publication-title: Proc. 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'97), Dagstuhl, Germany – start-page: 137 year: 1982 end-page: 146 ident: BIB040 article-title: Complexity of relational query languages publication-title: Proc. 14th ACM Symposium on Theory of Computing (STOC'82), San Francisco, CA – start-page: 164 year: 1996 end-page: 213 ident: BIB013 article-title: On the parametric complexity of relational database queries and a sharper characterization of publication-title: Proc. DMTCS'96 Combinatorics Complexity and Logics – volume: 7 start-page: 309 year: 1986 end-page: 322 ident: BIB038 article-title: Graph minors II. Algorithmic aspects of tree-width publication-title: J. Algorithms – volume: 7 start-page: 309 year: 1986 ident: 10.1016/S0004-3702(02)00182-0_BIB038 article-title: Graph minors II. Algorithmic aspects of tree-width publication-title: J. Algorithms doi: 10.1016/0196-6774(86)90023-4 – start-page: 89 year: 1988 ident: 10.1016/S0004-3702(02)00182-0_BIB001 article-title: Towards a theory of declarative knowledge – volume: 1265 start-page: 421 year: 1997 ident: 10.1016/S0004-3702(02)00182-0_BIB034 article-title: Smodels—An implementation of the stable model and well-founded semantics for normal LP – volume: 35 start-page: 401 year: 1988 ident: 10.1016/S0004-3702(02)00182-0_BIB003 article-title: Constraint satisfaction from a deductive viewpoint publication-title: Artificial Intelligence doi: 10.1016/0004-3702(88)90023-9 – volume: 10 start-page: 111 issue: 2 year: 1980 ident: 10.1016/S0004-3702(02)00182-0_BIB021 article-title: The directed subgraph homeomorphism problem publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(80)90009-2 – volume: 38 start-page: 353 year: 1989 ident: 10.1016/S0004-3702(02)00182-0_BIB008 article-title: Tree clustering for constraint networks publication-title: Artificial Intelligence doi: 10.1016/0004-3702(89)90037-4 – volume: 1730 start-page: 317 year: 1999 ident: 10.1016/S0004-3702(02)00182-0_BIB033 article-title: Stable model semantics of weight constraint rules – volume: 59 start-page: 63 issue: 1–2 year: 1993 ident: 10.1016/S0004-3702(02)00182-0_BIB009 article-title: A perspective on assumption-based truth maintenance publication-title: Artificial Intelligence doi: 10.1016/0004-3702(93)90171-7 – start-page: 164 year: 1996 ident: 10.1016/S0004-3702(02)00182-0_BIB013 article-title: On the parametric complexity of relational database queries and a sharper characterization of W[1] – start-page: 82 year: 1981 ident: 10.1016/S0004-3702(02)00182-0_BIB041 article-title: Algorithms for acyclic database schemes – volume: 114 start-page: 231 issue: 2 year: 1993 ident: 10.1016/S0004-3702(02)00182-0_BIB015 article-title: Propositional circumscription and extended closed world reasoning are ΠP2-complete publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(93)90073-3 – volume: 44 start-page: 527 issue: 4 year: 1997 ident: 10.1016/S0004-3702(02)00182-0_BIB028 article-title: Closure properties of constraints publication-title: J. ACM doi: 10.1145/263867.263489 – volume: 32 start-page: 57 issue: 1 year: 1987 ident: 10.1016/S0004-3702(02)00182-0_BIB037 article-title: A theory of diagnosis from first principles publication-title: Artificial Intelligence doi: 10.1016/0004-3702(87)90062-2 – start-page: 137 year: 1982 ident: 10.1016/S0004-3702(02)00182-0_BIB040 article-title: Complexity of relational query languages – start-page: 276 year: 1992 ident: 10.1016/S0004-3702(02)00182-0_BIB007 article-title: Constraint networks – start-page: 169 year: 1999 ident: 10.1016/S0004-3702(02)00182-0_BIB039 article-title: Computing large and small stable models – start-page: 1070 year: 1988 ident: 10.1016/S0004-3702(02)00182-0_BIB024 article-title: The stable model semantics for logic programming – ident: 10.1016/S0004-3702(02)00182-0_BIB036 – start-page: 205 year: 1998 ident: 10.1016/S0004-3702(02)00182-0_BIB029 article-title: Conjunctive-query containment and constraint satisfaction – volume: 24 start-page: 873 year: 1995 ident: 10.1016/S0004-3702(02)00182-0_BIB012 article-title: Fixed parameter tractability and completeness I: Basic results publication-title: SIAM J. Comput. doi: 10.1137/S0097539792228228 – start-page: 12 year: 1997 ident: 10.1016/S0004-3702(02)00182-0_BIB035 article-title: On the complexity of database queries – volume: 38 start-page: 219 year: 1999 ident: 10.1016/S0004-3702(02)00182-0_BIB006 article-title: Extremal problems in logic programming and stable model computation publication-title: J. Logic Programming doi: 10.1016/S0743-1066(98)10020-1 – volume: 1730 start-page: 177 year: 1999 ident: 10.1016/S0004-3702(02)00182-0_BIB019 article-title: Pushing goal derivation in DLP computations – volume: 32 start-page: 755 issue: 4 year: 1985 ident: 10.1016/S0004-3702(02)00182-0_BIB022 article-title: A sufficient condition for backtrack-bounded search publication-title: J. ACM doi: 10.1145/4221.4225 – start-page: 36 year: 1992 ident: 10.1016/S0004-3702(02)00182-0_BIB011 article-title: Fixed parameter intractability (extended abstract) – year: 1999 ident: 10.1016/S0004-3702(02)00182-0_BIB014 – volume: 10 start-page: 96 year: 1927 ident: 10.1016/S0004-3702(02)00182-0_BIB032 article-title: Zur allgemeinen Kurventheorie publication-title: Fund. Math. doi: 10.4064/fm-10-1-96-115 – ident: 10.1016/S0004-3702(02)00182-0_BIB025 – volume: 124 start-page: 243 year: 2000 ident: 10.1016/S0004-3702(02)00182-0_BIB026 article-title: A comparison of structural CSP decomposition methods publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(00)00078-3 – volume: 87 start-page: 161 year: 1992 ident: 10.1016/S0004-3702(02)00182-0_BIB010 article-title: Fixed parameter tractability and completeness publication-title: Congr. Numer. – ident: 10.1016/S0004-3702(02)00182-0_BIB020 – year: 1979 ident: 10.1016/S0004-3702(02)00182-0_BIB023 – year: 2000 ident: 10.1016/S0004-3702(02)00182-0_BIB017 article-title: Declarative problem-solving using the DLV system – volume: 1683 start-page: 264 year: 1999 ident: 10.1016/S0004-3702(02)00182-0_BIB027 article-title: Descriptive and parametrized complexity – volume: 27 start-page: 129 year: 1999 ident: 10.1016/S0004-3702(02)00182-0_BIB005 article-title: Propositional lower bounds: Generalization and algorithms publication-title: Ann. Math. Artif. Intell. doi: 10.1023/A:1018971231561 – year: 1986 ident: 10.1016/S0004-3702(02)00182-0_BIB030 – start-page: 406 year: 1998 ident: 10.1016/S0004-3702(02)00182-0_BIB016 article-title: The KR system dlv: Progress report comparisons and benchmarks – year: 1993 ident: 10.1016/S0004-3702(02)00182-0_BIB031 – volume: 25 start-page: 1305 issue: 6 year: 1996 ident: 10.1016/S0004-3702(02)00182-0_BIB004 article-title: A linear-time algorithm for finding tree-decompositions of small treewidth publication-title: SIAM J. Comput. doi: 10.1137/S0097539793251219 – volume: 30 start-page: 479 issue: 3 year: 1983 ident: 10.1016/S0004-3702(02)00182-0_BIB002 article-title: On the desirability of acyclic database schemes publication-title: J. ACM doi: 10.1145/2402.322389 – year: 1979 ident: 10.1016/S0004-3702(02)00182-0_BIB018
SSID	ssj0003991
Score	2.0124202
Snippet	Many relevant intractable problems become tractable if some problem parameter is fixed. However, various problems exhibit very different computational... Article included in a special issue devoted to the theme: Knowledge presentation and logic programming. Many relevant intractable problems become tractable if...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	55
SubjectTerms	Artificial intelligence Circumscription Conjunctive queries Constraint satisfaction Fixed-parameter tractability Knowledge representation Logic programming Nonmonotonic reasoning Parameterized complexity Prime implicants Stable models
Title	Fixed-parameter complexity in AI and nonmonotonic reasoning
URI	https://dx.doi.org/10.1016/S0004-3702(02)00182-0 https://www.proquest.com/docview/57519330
Volume	138
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7921 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZgy4FLeavlUXzgAIdANo5jW5xWqBWLUIVEQXuLHMcRK5Wk2k3R_nxmbMdZWqoCElJkRY4fkWcy_jKeByEvas6NNpUE5p1WSV5ULNFZVid8CuDeNA3LnbX714_i-FguFupTOIpZu3QCom3lZqPO_iupoQ6Ija6zf0HuOChUwD0QHUogO5R_RPij5cbWCYb0_o6mLt5o3G4QbaNuY-6OC-CnH16o613-G7RLd1rZbaQ6WzkrIpfTYytsZ7TX6fr-tKuiWn37QMcMBzoua4ddmy4-Rae_ZfAR6r_pX3QO2Wgb5RVhl5xhgnDNgeSpF67Wy1MpAMAr7wQdBS6TlzjLi08fsXfYiIvfinivbfgcZwMgjoXC9ILwouO-Fq0NXVtsmmauUXqT7GSCKzkhO7P54eJD3LoBrYUUi37s0eXrzTjhyzR7FSa7Csxc2NYdVjm5S3bDTwadeea4R27Y9j65MyTwoEGePyBvL_AKHXmFLls6m1PgFbrNKzTyykPy5ejw5N37JGTTSEzGWZ8UvOHKcF4paWyhbW2FUprZWjRFrptG2Erwmlk15VDT6KIStWGV4sYqDB7LHpEJTGj3CHVB0lLGCy1k3vBKmqnK60baGuBiUeh9kg_LUpoQah4znpyWo00hrGaJq1nihatZpvvkdex25mOtXNdBDmteBsDogWAJzHJd1-cDjUoQqPhh6NZ25-sSDyJRy_f43wd_Qm6PX81TMulX5_YZuWV-9Mv16iAw3U9SJpS8
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fixed-parameter+complexity+in+AI+and+nonmonotonic+reasoning&rft.jtitle=Artificial+intelligence&rft.au=Gottlob%2C+Georg&rft.au=Scarcello%2C+Francesco&rft.au=Sideri%2C+Martha&rft.date=2002-06-01&rft.pub=Elsevier+B.V&rft.issn=0004-3702&rft.eissn=1872-7921&rft.volume=138&rft.issue=1&rft.spage=55&rft.epage=86&rft_id=info:doi/10.1016%2FS0004-3702%2802%2900182-0&rft.externalDocID=S0004370202001820
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon