| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Baader, F., Brandt, S. & Lutz, C. | Pushing the EL Envelope | 2005 | International Joint Conferences on Artificial Intelligence (IJCAI-05) | inproceedings | URL |
| Abstract: Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already intractable in the presence of acyclic TBoxes, it remains tractable in EL even with general concept inclusion axioms (GCIs). On the one hand, we extend the positive result for EL by identifying a set of expressive means that can be added to EL without sacrificing tractability. On the other hand, we show that basically all other additions of typical DL constructors to EL with GCIs make subsumption intractable, and in most cases even EXPTIMEc omplete. In addition, we show that subsumption in FL0 with GCIs is EXPTIME-complete. | |||||
BibTeX:
@inproceedings{el++,
author = {Franz Baader and Sebastian Brandt and Carsten Lutz},
title = {Pushing the EL Envelope},
booktitle = {International Joint Conferences on Artificial Intelligence (IJCAI-05)},
year = {2005},
url = {http://www.ijcai.org/papers/0372.pdf}
}
|
|||||
| Borgida, A., Walsh, T. & Hirsh, H. | Towards Measuring Similarity in Description Logics. [BibTeX] |
2005 | Proceedings of the 2005 International Workshop on Description Logics (DL2005), July 26-28, 2005, Edinburgh, Scotland, UK | inproceedings | URL |
BibTeX:
@inproceedings{borgida05similarity,
author = {Alexander Borgida and Thomas Walsh and Haym Hirsh},
title = {Towards Measuring Similarity in Description Logics.},
booktitle = {Proceedings of the 2005 International Workshop on Description Logics (DL2005), July 26-28, 2005, Edinburgh, Scotland, UK},
publisher = {CEUR-WS.org},
year = {2005},
volume = {147},
url = {http://www.ceur-ws.org/Vol-147/25-BorgidaEtAl.pdf}
}
|
|||||
| Calvanese, D., Giacomo, G. D., Lembo, D., Lenzerini, M. & Rosati, R. | Tailoring OWL for Data Intensive Ontologies | 2005 | Proceedings of the OWL: Experiences and Directions Workshop, Galway, Ireland | inproceedings | URL |
| Abstract: The idea of using ontologies as a conceptual view over data repositories is becoming more and more popular. In these contexts, data are typically very large (much larger than the intentional level of the ontologies), and query answering becomes the basic reasoning services. In these contexts query answering should be very efficient on the data, and currently the only technology that is available to deal with large amounts of data is the one provided by relational data management systems (RDBMS). In this paper we advocate that for such contexts a suitable fragment of OWL-DL should be devised. Such a fragment must allow forms of query answering that exploit RDBMS when reasoning on the data, while it must include the main modeling features of conceptual models like UML class diagrams and ER diagrams. In particular it must include cyclic assertions, ISA on concepts, inverses of roles, role typing, mandatory participation to roles, and functional restrictions on roles. Also the query language should go beyond the expressive capabilities of concept expressions in description logics, and include at least conjunctive queries (corresponding to the select-project-join fragment of SQL). We discuss this issues by exhibiting a fragment of OWL-DL that includes all such features, namely DL-Lite, and showing that such a fragment is essentially maximal. | |||||
BibTeX:
@inproceedings{dl-lite,
author = {Diego Calvanese and Giuseppe De Giacomo and Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati},
title = {Tailoring OWL for Data Intensive Ontologies},
booktitle = {Proceedings of the OWL: Experiences and Directions Workshop, Galway, Ireland},
year = {2005},
url = {http://www.mindswap.org/OWLWorkshop/sub13.pdf}
}
|
|||||
| Eiter, T., Ianni, G., Polleres, A., Schindlauer, R. & Tompits, H. | Reasoning with Rules and Ontologies. [BibTeX] |
2006 | Reasoning Web | inproceedings | URL |
BibTeX:
@inproceedings{Eiter2006,
author = {Thomas Eiter and Giovambattista Ianni and Axel Polleres and Roman Schindlauer and Hans Tompits},
title = {Reasoning with Rules and Ontologies.},
booktitle = {Reasoning Web},
publisher = {Springer},
year = {2006},
volume = {4126},
pages = {93-127},
url = {http://dblp.uni-trier.de/db/conf/rweb/rweb2006.html#EiterIPST06}
}
|
|||||
| Grosof, B., Horrocks, I., Volz, R. & Decker, S. | Description Logic Programs: Combining Logic Programming with Description Logic | 2003 | Proceedings of the WWW2003 Conference, Budapest, Hungary | inproceedings | URL |
| Abstract: We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of first-order logic (FOL). DLP provides a significant degree of expressiveness, substantially greater than the RDF-Schema fragment of Description Logic. | |||||
BibTeX:
@inproceedings{dlp,
author = {Benjamin Grosof and Ian Horrocks and Raphael Volz and Stefan Decker},
title = {Description Logic Programs: Combining Logic Programming with Description Logic},
booktitle = {Proceedings of the WWW2003 Conference, Budapest, Hungary},
publisher = {ACM},
year = {2003},
url = {http://www2003.org/cdrom/papers/refereed/p117/p117-grosof.html}
}
|
|||||
| Horrocks, I., Kutz, O. & Sattler, U. | The Even More Irrestistible SROIQ [BibTeX] |
2006 | Proc. of the 10th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2006) | inproceedings | URL |
BibTeX:
@inproceedings{sriq,
author = {Ian Horrocks and Oliver Kutz and Uli Sattler},
title = {The Even More Irrestistible SROIQ},
booktitle = {Proc. of the 10th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2006)},
publisher = {AAAI Press},
year = {2006},
url = {http://www.cs.man.ac.uk/%7Esattler/publications/sroiq-tr.pdf}
}
|
|||||
| Hustadt, U., Motik, B. & Sattler, U. | Data Complexity of Reasoning in Very Expressive Description Logics | 2005 | Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI-05) | inproceedings | URL |
| Abstract: Data complexity of reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size of the ABox only. We show that, even for the very expressive DL SHIQ, satisfiability checking is data complete for NP. For applications with large ABoxes, this can be a more accurate estimate than the usually considered combined complexity, which is EXPTIME complete. Furthermore, we identify an expressive fragment, Horn-SHIQ, which is data complete for P, thus being very appealing for practical usage. | |||||
BibTeX:
@inproceedings{horn-shiq,
author = {Ullrich Hustadt and Boris Motik and Ulrike Sattler},
title = {Data Complexity of Reasoning in Very Expressive Description Logics},
booktitle = {Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI-05)},
year = {2005},
url = {http://www.ijcai.org/papers/0326.pdf}
}
|
|||||
| Klusch, M., Fries, B. & Sycara, K. | Automated semantic web service discovery with OWLS-MX. [BibTeX] |
2006 | AAMAS | inproceedings | URL |
BibTeX:
@inproceedings{conf/atal/KluschFS06,
author = {Matthias Klusch and Benedikt Fries and Katia Sycara},
title = {Automated semantic web service discovery with OWLS-MX.},
booktitle = {AAMAS},
publisher = {ACM},
year = {2006},
pages = {915-922},
url = {http://dblp.uni-trier.de/db/conf/atal/aamas2006.html#KluschFS06}
}
|
|||||
| Noia, T. D., Sciascio, E. D. & Donini, F. M. | Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach [BibTeX] |
2007 | Journal of Artificial Intelligence Research | article | |
BibTeX:
@article{DiNoia2007,
author = {Tommaso Di Noia and Eugenio Di Sciascio and Francesco M. Donini},
title = {Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach},
journal = {Journal of Artificial Intelligence Research},
year = {2007},
volume = {29},
pages = {269-307}
}
|
|||||
| Wang, T. D., Parsia, B. & Hendler, J. | A Survey of theWeb Ontology Landscape | 2006 | 5th International Semantic Web Conference, Athens, GA, USA, November 5-9 | inproceedings | URL |
| Abstract: We survey nearly 1300 OWL ontologies and RDFS schemas. The collection of statistical data allows us to perform analysis and report some trends. Though most of the documents are syntactically OWL Full, very few stay in OWL Full when they are syntactically patched by adding type triples. We also report the frequency of occurrences of OWL language constructs and the shape of class hierarchies in the ontologies. Finally, we note that of the largest ontologies surveyed here, most do not exceed the description logic expressivity of ALC | |||||
BibTeX:
@inproceedings{ontology-survey2006,
author = {Taowei David Wang and Bijan Parsia and James Hendler},
title = {A Survey of theWeb Ontology Landscape},
booktitle = {5th International Semantic Web Conference, Athens, GA, USA, November 5-9},
publisher = {Springer Verlag},
year = {2006},
number = {LNCS 4273},
url = {http://iswc2006.semanticweb.org/items/paper_6.php}
}
|
|||||
Created by JabRef export filters on 08/09/2008 by the social publication management platform BibSonomy