scispace - formally typeset
I

Ian Horrocks

Researcher at University of Oxford

Publications -  488
Citations -  40046

Ian Horrocks is an academic researcher from University of Oxford. The author has contributed to research in topics: Ontology (information science) & Description logic. The author has an hindex of 87, co-authored 472 publications receiving 38785 citations. Previous affiliations of Ian Horrocks include The Turing Institute & National and Kapodistrian University of Athens.

Papers
More filters
Proceedings Article

Reasoning with expressive description logics: logical foundations for the semantic web

Ian Horrocks
TL;DR: This talk will give a brief history of DLs and of DL applications, in particular their application in the context of the Semantic Web, and an overview of the reasoning techniques that are employed by state of the art DL implementations, and which enable them to be effective in realistic applications in spite of the high worst case complexity of their basic inference problems.
Journal Article

Pay−as−you−go Ontology Query Answering Using a Datalog Reasoner

TL;DR: In this article, a hybrid approach to conjunctive query answering over OWL 2 ontologies is described, which combines a datalog reasoner with a fully-fledged OWL2 reasoner in order to provide scalable query answering performance.

D2.5.2 Report on Query Language Design and Standardisation

TL;DR: This report focuses on the problems of query answering for Semantic Web query languages (such as RDF, OWL DL and OWL-E) in the OWl-QL specification.
Proceedings Article

Is my ontology matching system similar to yours

TL;DR: The evaluation of the OAEI 2012 Large BioMed track, which involves the matching of the semantically rich ontologies FMA, NCI and SNOMED CT, is extended and differences and similarities among the mappings computed by the participant ontology matching systems are reported.
Book ChapterDOI

Streaming Partitioning of RDF Graphs for Datalog Reasoning

TL;DR: In this article, the authors present two new RDF partitioning strategies, which are inspired by recent streaming graph partitioning algorithms, which partition a graph while keeping only a small subset of the graph in memory.