Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

DLOG
2011

favoriteEmaildiscussreport

251views Automated Reasoning» more DLOG 2011»

Status QIO: An Update

12 years 7 months ago

Status QIO: An Update

Download sunsite.informatik.rwth-aachen.de

We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to OWL DL and OWL2 DL, of which ALCOIF is an important fragment. A matching upper bound remains open.

Birte Glimm, Yevgeny Kazakov, Carsten Lutz

Real-time Traffic

Automated Reasoning | DLOG 2011 | Entailment | Fragment | Upper Bound |

claim paper

Related Content

» Status QIO Conjunctive Query Entailment Is Decidable

» Faceplant Impression Mismanagement in Facebook Status Updates

» Securing the Border Gateway Protocol A Status Update

» Eddi interactive topicbased browsing of social status streams

» Summarizing sporting events using twitter

» On Generation of Firewall Log Status Reporter SRr Using Perl

» Status Report on Description Logics related Project in Korea

» Visualizing the Thematic Update Status of Web and WAP Sites on Mobile Phones

» Update Monitoring The CQ Project

Post Info
More Details (n/a)

Added	27 Aug 2011
Updated	27 Aug 2011
Type	Journal
Year	2011
Where	DLOG
Authors	Birte Glimm, Yevgeny Kazakov, Carsten Lutz

Comments (0)