Fixed-parameter complexity in AI and nonmonotonic reasoning
- 1 June 2002
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 138 (1-2) , 55-86
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Propositional lower bounds: Algorithms and complexityAnnals of Mathematics and Artificial Intelligence, 1999
- Extremal problems in logic programming and stable model computationThe Journal of Logic Programming, 1999
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Propositional circumscription and extended closed-world reasoning are ΠP2-completeTheoretical Computer Science, 1993
- A perspective on assumption-based truth maintenanceArtificial Intelligence, 1993
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Constraint satisfaction from a deductive viewpointArtificial Intelligence, 1988
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980