Pages that link to "Item:Q1603733"
From MaRDI portal
The following pages link to Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733):
Displayed 29 items.
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Algorithms for Propositional Model Counting (Q3498488) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- (Q4966309) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- (Q5150410) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)