Fixed-parameter complexity in AI and nonmonotonic reasoning
From MaRDI portal
Publication:1603733
Recommendations
Cites work
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1222098 (Why is no real title available?)
- scientific article; zbMATH DE number 478394 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1453071 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A comparison of structural CSP decomposition methods
- A sufficient condition for backtrack-bounded search
- A theory of diagnosis from first principles
- Closure properties of constraints
- Conjunctive-query containment and constraint satisfaction
- Constraint satisfaction from a deductive viewpoint
- Declarative problem-solving using the DLV system
- Extremal problems in logic programming and stable model computation
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Graph minors. II. Algorithmic aspects of tree-width
- On the Desirability of Acyclic Database Schemes
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Propositional lower bounds: Algorithms and complexity
- The complexity of acyclic conjunctive queries
- The directed subgraph homeomorphism problem
- Tree clustering for constraint networks
Cited in
(34)- Backdoors to tractable answer set programming
- On the complexity of planning for agent teams and its implications for single agent planning
- On the parameterized complexity of non-monotonic logics
- Fixed-parameter complexity of semantics for logic programs
- Tractable structures for constraint satisfaction with truth tables
- Solving infinite-domain CSPs using the patchwork property
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Constraint satisfaction with bounded treewidth revisited
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Analysis parameterized algorithms on the bases of elasticity to functions complexity
- Solving \#SAT using vertex covers
- Dealing with several parameterized problems by random methods
- Fixed-parameter algorithms for closed world reasoning
- A multiparametric view on answer set programming
- Visualizing SAT instances and runs of the DPLL algorithm
- Complexity and Algorithms for Well-Structured k-SAT Instances
- Logic programming and knowledge representation---The A-Prolog perspective
- Computational properties of argument systems satisfying graph-theoretic constraints
- Parameterized algorithms for edge biclique and related problems
- An improved kernel for max-bisection above tight lower bound
- New width parameters for SAT and \#SAT
- Algorithms for propositional model counting
- Strong Backdoors for Default Logic
- Sum-of-Products with Default Values: Algorithms and Complexity Results
- Strong backdoors for default logic
- Improved kernel results for some FPT problems based on simple observations
- Strong backdoors for default logic
- Algorithms for Propositional Model Counting
- An improved FPT algorithm for almost forest deletion problem
- FPT-algorithms and their classification on the basis of elasticity
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Parameterized complexity classes beyond para-NP
This page was built for publication: Fixed-parameter complexity in AI and nonmonotonic reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603733)
