A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
A theory of diagnosis from first principles
Artificial Intelligence
Constraint satisfaction from a deductive viewpoint (Research Note)
Artificial Intelligence
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Tree clustering for constraint networks (research note)
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Closure properties of constraints
Journal of the ACM (JACM)
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Computing large and small stable models
Proceedings of the 1999 international conference on Logic programming
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Graph Algorithms
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Declarative problem-solving using the DLV system
Logic-based artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A Comparison of Structural CSP Decomposition Methods
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Theory of Relational Databases
Theory of Relational Databases
Parameterized Complexity
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Consistency property of finite FC-normal logic programs
Journal of Computer Science and Technology
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
On odd and even cycles in normal logic programs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The Logical Consequence Role in LPNMR: A Parameterized Computation Approach
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Algorithms for propositional model counting
Journal of Discrete Algorithms
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Parameterized complexity and fixed-parameter tractability of description logic reasoning
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The good, the bad, and the odd: cycles in answer-set programs
ESSLLI'10 Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
On the complexity of planning for agent teams and its implications for single agent planning
Artificial Intelligence
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
Hi-index | 0.01 |
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.