Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
Random instances of W[2]-complete problems: thresholds, complexity, and algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Composition with target constraints
Proceedings of the 13th International Conference on Database Theory
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
A benchmark diagnostic model generation system
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on model-based diagnostics
Satisfiability of acyclic and almost acyclic CNF formulas (II)
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
Discrete Applied Mathematics
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Augmenting tractable fragments of abstract argumentation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
The Multivariate Algorithmic Revolution and Beyond
A REVIEW OF TREE CONVEX SETS TEST
Computational Intelligence
Breaking variable symmetry in almost injective problems
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Abstract argumentation via monadic second order logic
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Boundary properties of the satisfiability problems
Information Processing Letters
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We survey the parameterized complexity of problems that arise in artificial intelligence, database theory and automated reasoning. In particular, we consider various parameterizations of the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries and the propositional satisfiability problem. Furthermore, we survey parameterized algorithms for problems arising in the context of the stable model semantics of logic programs, for a number of other problems of non-monotonic reasoning, and for the computation of cores in data exchange.