7 search results - page 2 / 2 » Conjunctive Queries for a Tractable Fragment of OWL 1.1 |
CNL
2009
13 years 6 months ago
2009
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
CSL
2009
Springer
13 years 9 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...