Fixed-parameter complexity in AI and nonmonotonic reasoning

Georg Gottlob, Francesco Scarcello, Martha Sideri
<span title="">2002</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/weoplee4x5anpi62cco5v4higa" style="color: black;">Artificial Intelligence</a> </i> &nbsp;
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
more &raquo; ... 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.  (F. Scarcello), sideri@aueb.gr (M. Sideri). 0004-3702/02/$ -see front matter  2002 Elsevier Science B.V. All rights reserved. PII: S 0 0 0 4 -3 7 0 2 ( 0 2 ) 0 0 1 8 2 -0 , where k 2 is the parameter, c 1 , c 2 are fixed constants, and k 1 is either a fixed constant or the parameter.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0004-3702(02)00182-0">doi:10.1016/s0004-3702(02)00182-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vrfcg23nyjettjkvt2y3nne4ky">fatcat:vrfcg23nyjettjkvt2y3nne4ky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922022109/http://www2.aueb.gr/users/sideri/papers/ai2002.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/42/ab/42ab17601d9d38312015eb78005af9c0fe8f3d49.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0004-3702(02)00182-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>