Fixed Parameter Tractable Reasoning in DLs via Decomposition
Frantisek Simancik
Info
|
Date |
17th May 2011 (week 3, Trinity Term 2011) |
|
Time |
11:30 |
|
Place |
147 |
Abstract
I will present a novel method for fixed parameter tractable reasoning in the description logic ALCI, which is inspired by the work on parameterizing propositional SAT by treewidth. I will first motivate the talk by showing how to use resolution to obtain a fixed parameter tractable algorithm for propositional clause-sets of bounded treewidth, and then generalize the method to support existential and universal quantifiers.
Further info
|
Related series |
|
