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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Artificial intelligence Jg. 138; H. 1; S. 55 - 86
Hauptverfasser:	Gottlob, Georg, Scarcello, Francesco, Sideri, Martha
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.06.2002
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!