Grant: Discovery Grants Program - Individual
Concordia University
$27,000.00
Scalable description logic reasoning architectures for the semantic web
FY 2011-12
Summary
The semantic web extends the WWW from a collection of data and documents, that are designed for human consumption and are often hard to find and use, into a collection of knowledge that is understandable and very convenient to use by humans as well as computer programs. The knowledge available in the semantic web depends on wide-spread information (e.g., collections of web pages) and on the compilation of information into (often distributed) formal ontologies or knowledge bases. The Web Ontology Language (OWL) was approved in 2004 as a W3C recommendation. It is a response to the semantic web initiative and has become a de-facto standard in knowledge representation for many scientific communities as well as companies and governments. OWL is partially based on a family of knowledge representation formalisms called description logics. The appeal of description logics is the immediate availability of highly optimized reasoners offering a wide range of automatic inference services relevant for supporting the semantic web. Description logic reasoners are usually based on so-called tableau procedures requiring highly sophisticated optimization techniques due to their inherent runtime complexity. The first objective of this proposal is to achieve better reasoning scalability and to support persistency. This goal is due to recent developments in the semantic web community where (simple description logic) reasoning has been applied to very large ontologies consisting of up to millions of assertions. The challenge is to provide persistency and ensure scalability even if complex reasoning is required. This motivates the need to design and evaluate tableau optimization techniques which support scalable reasoning on persistent and virtually unlimited ontologies. The second objective is to develop novel optimization techniques for combinations of description logic constructors such as number restrictions, nominals, and inverse roles because known techniques are insufficient.
Program
Discovery Grants Program - Individual
Recipient
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
261562-2008
Name nom
Haarslev, Volker
Department département
Computer Science and Software Engineering
Organization id
70
Institution établissement
Concordia University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2008
Award amount
27000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2803
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Knowledge representation
Research subject fr
Répresentation des connaissances
Partie
4
Nb partie
5
Application title
Scalable description logic reasoning architectures for the semantic web
Keyword
NSERC
Application summary
The semantic web extends the WWW from a collection of data and documents, that are designed for human consumption and are often hard to find and use, into a collection of knowledge that is understandable and very convenient to use by humans as well as computer programs. The knowledge available in the semantic web depends on wide-spread information (e.g., collections of web pages) and on the compilation of information into (often distributed) formal ontologies or knowledge bases. The Web Ontology Language (OWL) was approved in 2004 as a W3C recommendation. It is a response to the semantic web initiative and has become a de-facto standard in knowledge representation for many scientific communities as well as companies and governments. OWL is partially based on a family of knowledge representation formalisms called description logics. The appeal of description logics is the immediate availability of highly optimized reasoners offering a wide range of automatic inference services relevant for supporting the semantic web. Description logic reasoners are usually based on so-called tableau procedures requiring highly sophisticated optimization techniques due to their inherent runtime complexity. The first objective of this proposal is to achieve better reasoning scalability and to support persistency. This goal is due to recent developments in the semantic web community where (simple description logic) reasoning has been applied to very large ontologies consisting of up to millions of assertions. The challenge is to provide persistency and ensure scalability even if complex reasoning is required. This motivates the need to design and evaluate tableau optimization techniques which support scalable reasoning on persistent and virtually unlimited ontologies. The second objective is to develop novel optimization techniques for combinations of description logic constructors such as number restrictions, nominals, and inverse roles because known techniques are insufficient.