Pages that link to "Item:Q2269134"

The following pages link to Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134):

Displaying 20 items.

• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• On the parameterized complexity of non-monotonic logics (Q494658) (← links)
• Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
• Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints (Q1678427) (← links)
• Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
• New width parameters for SAT and \#SAT (Q2238644) (← links)
• A multiparametric view on answer set programming (Q2317973) (← links)
• Backdoors to tractable answer set programming (Q2341833) (← links)
• Tractable cases of the extended global cardinality constraint (Q2430356) (← links)
• Parameterized Complexity of CTL (Q2799205) (← links)
• Strong Backdoors for Default Logic (Q2818000) (← links)
• Recognizable languages of arrows and cospans (Q4585008) (← links)
• (Q5090465) (← links)
• Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
• Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
• Tractable answer-set programming with weight constraints: bounded treewidth is not enough (Q5410728) (← links)
• Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
• Reasoning in assumption-based argumentation using tree-decompositions (Q6545531) (← links)
• Strong backdoors for default logic (Q6570091) (← links)
• Strong backdoors for default logic (Q6610193) (← links)