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...

Full description

Saved in:

Bibliographic Details
Published in:	Artificial intelligence Vol. 138; no. 1; pp. 55 - 86
Main Authors:	Gottlob, Georg, Scarcello, Francesco, Sideri, Martha
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2002
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!