39 search results - page 3 / 8 » Data Complexity of Answering Unions of Conjunctive Queries i... |
JAR
2007
13 years 6 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
EDBT
2008
ACM
14 years 6 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
ICDT
2001
ACM
13 years 10 months ago
2001
ACM
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
LPAR
2004
Springer
13 years 11 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
LPAR
2007
Springer
14 years 15 days ago
2007
Springer
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...