Reasoning the FMA Ontologies with TrOWL Jeff Z. Pan, Yuan Ren, Nophadol Jekjantuk, and Jhonatan Garcia University of Aberdeen, UK ORE2013.

Slides:



Advertisements
Similar presentations
Solving inconsistent ontologies with heuristics Joey Lam, Derek Sleeman, Wamberto Vasconcelos 23 Jan 2006.
Advertisements

Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
Ontologies and Databases Ian Horrocks Information Systems Group Oxford University Computing Laboratory.
Query Answering based on Standard and Extended Modal Logic Evgeny Zolin The University of Manchester
SPARQL Dimitar Kazakov, with references to material by Noureddin Sadawi ARIN, 2014.
OWL - DL. DL System A knowledge base (KB) comprises two components, the TBox and the ABox The TBox introduces the terminology, i.e., the vocabulary of.
Feature modeling and Verification based on Description Logics
Ontological Logic Programming by Murat Sensoy, Geeth de Mel, Wamberto Vasconcelos and Timothy J. Norman Computing Science, University of Aberdeen, UK 1.
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Logic.
High-level Data Access Based on Query Rewritings Ekaterina Stepalina Higher School of Economics.
Analyzing Minerva1 AUTORI: Antonello Ercoli Alessandro Pezzullo CORSO: Seminari di Ingegneria del SW DOCENTE: Prof. Giuseppe De Giacomo.
Proof methods Proof methods divide into (roughly) two kinds: –Application of inference rules Legitimate (sound) generation of new sentences from old Proof.
Chapter 8: Web Ontology Language (OWL) Service-Oriented Computing: Semantics, Processes, Agents – Munindar P. Singh and Michael N. Huhns, Wiley, 2005.
Approximate Inference Techniques and Their Applications to the Semantic Web Perry Groot IPA Fall days, 26 November 2004.
Methods of Proof Chapter 7, second half.
How can Computer Science contribute to Research Publishing?
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
Editing Description Logic Ontologies with the Protege OWL Plugin.
Chapter 8 Architecture Analysis. 8 – Architecture Analysis 8.1 Analysis Techniques 8.2 Quantitative Analysis  Performance Views  Performance.
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
Tableau Algorithm.
OWL 2 Web Ontology Language. Topics Introduction to OWL Usage of OWL Problems with OWL 1 Solutions from OWL 2.
Using the TBox to Optimise SPARQL Queries Birte Glimm Yevgeny Kazakov Ilianna Kollia and Giorgos Stamou CS 848 Paper Critique Vishnu Prathish.
LDK R Logics for Data and Knowledge Representation ClassL (part 3): Reasoning with an ABox 1.
DRAGO: Distributed Reasoning Architecture for the Semantic Web Andrei Tamilin and Luciano Serafini Work is supported by 1 June 2005 Second European Semantic.
An Introduction to Description Logics (chapter 2 of DLHB)
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic.
Advanced topics in software engineering (Semantic web)
SSO: THE SYNDROMIC SURVEILLANCE ONTOLOGY Okhmatovskaia A, Chapman WW, Collier N, Espino J, Conway M, Buckeridge DL Ontology Description The SSO was developed.
Updating ABoxes in DL-Lite D. Calvanese, E. Kharlamov, W. Nutt, D. Zheleznyakov Free University of Bozen-Bolzano AMW 2010, May 2010.
More on Description Logic(s) Frederick Maier. Note Added 10/27/03 So, there are a few errors that will be obvious to some: So, there are a few errors.
Using Fuzzy DLs to Enhance Semantic Image Analysis S. Dasiopoulou, I. Kompatsiaris, M.G.Strintzis 3 rd International Conference on Semantic and Digital.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
DAML+OIL: an Ontology Language for the Semantic Web.
OilEd An Introduction to OilEd Sean Bechhofer. Topics we will discuss Basic OilEd use –Defining Classes, Properties and Individuals in an Ontology –This.
DL Overview Second Pass Ming Fang 06/19/2009. Outlines  Description Languages  Knowledge Representation in DL  Logical Inference in DL.
LDK R Logics for Data and Knowledge Representation ClassL (Propositional Description Logic with Individuals) 1.
Description Logics Dr. Alexandra I. Cristea. Description Logics Description Logics allow formal concept definitions that can be reasoned about to be expressed.
ece 627 intelligent web: ontology and beyond
CSE-291: Ontologies in Data Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
1 Instance Store Database Support for Reasoning over Individuals S Bechhofer, I Horrocks, D Turi. Instance Store - Database Support for Reasoning over.
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
Ontology Technology applied to Catalogues Paul Kopp.
Distributed Instance Retrieval over Heterogeneous Ontologies Andrei Tamilin (1,2) & Luciano Serafini (1) (1) ITC-IRST (2) DIT - University of Trento Trento,
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
Knowledge Representation Part II Description Logic & Introduction to Protégé Jan Pettersen Nytun.
Formal ontologies vs. triple based KR gap or convergence?
ece 720 intelligent web: ontology and beyond
EA C461 – Artificial Intelligence Logical Agent
Jie Bao, Doina Caragea and Vasant G Honavar
Ontology.
Logics for Data and Knowledge Representation
Small is Again Beautiful in Description Logics
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Local Closed World Reasoning in the Semantic Web
Ontology.
Ontologies and Databases
Methods of Proof Chapter 7, second half.
Logics for Data and Knowledge Representation
Test-Driven Ontology Development in Protégé
A Tutorial Summary of Description Logic and Hybrid Rules
CIS Monthly Seminar – Software Engineering and Knowledge Management IS Enterprise Modeling Ontologies Presenter : Dr. S. Vasanthapriyan Senior Lecturer.
Presentation transcript:

Reasoning the FMA Ontologies with TrOWL Jeff Z. Pan, Yuan Ren, Nophadol Jekjantuk, and Jhonatan Garcia University of Aberdeen, UK ORE2013

The FMA ontology The Foundational Model of Anatomy ontology is “an evolving computer-based knowledge source for biomedical informatics” – Developed with Protégé as a FRAME-BASED system – Consists of several components such as Metaknowledge – Evolves (latest version released in 2010) – Highly expressive Several OWL translations – DLR and FullR: OWL DL/FULL versions without/with metamodelling – Constitutional: alternative OWL DL translation with metamodelling – OWL2G_noMTC: OWL2 translation from FAM 3.0 without metamodelling – DLR_M1/M2: portion of DLR enriched with the class-based approach (Glimm et al., 2010) to accommodate metaclasses

TrOWL: Tractable reasoning infrastructure for OWL 2 Semantic Approximation (AAAI2007) – Pre-compute and compile the materialisation of OWL 2 ontologies in OWL 2 QL – Sound and complete for conjunctive queries without non- distinguished variables – Tractable in run-time Syntactic Approximation (AAAI2010) – Normalise OWL 2 axioms into nominal-safe EL++ with additional data structures to maintain non-EL semantics – Approximate deduction on the normalisation results – Sound, incomplete but practically high recall for many ontologies – Tractable TBox classification and ABox materialisation Oracle 11g support, SPARQL 1.1 query answering (leveraging OWL- BGP), local closed world reasoning, Jena API, etc.

Syntactic Approximation Normalisation – Representing non-EL expressions with fresh names – Maintain complementary relations Deduction – CEL rules – Additional rules E.g. A subClassOf B => not B subClassOf not A Example ontology: – A subClassOf forall r B – forall r C subClassOf D – B subClassOf C – => – A subClassOf D ALL r r B B A A C C D D Some r r nB A A nC Some D D B B C C X1 X2

Metamodelling in FMA Ontology FMA frame-based ontology contains metamodelling – E.g. Physical_anatomical_entity instanceOf Anatomical_entity_template – Physical_anatomical_entity subClassOf Anatomical_entity Different implementations in OWL ontologies – FMA FullR uses OWL Full; – FMA Consititutional encodes metaclass assertions with class subsumptions, metaproperty assertions with existential and universal restrictions; – OWL 2 DL with punning semantics A class and an individual with same IRI will still be treated as different entities, leading to incomplete results – OWL 2 DL with class-based approach Introducing representative individual of each concept Encoding subsumptions/class assertions with object property relations

Evaluation Results FMA ontologies are in general very difficult to reason with – Especially with Metamodelling involved TrOWL performs generally well on FMA ontologies – Generally faster than fully-fledged, universal, intractable reasoners; – The only one to classify FMA-OWL2G_noMTC TBox in 1 hour; – Practically high recall

Dealing with Unsatisfiable Concepts Translated versions of FMA contain many unsatisfiabilities – FMA Constitutional: 33,433 / 41,648 – FMA OWL2G_noMTC: 67,771 / 85,005 Investigating such unsatisfiabilities is difficult – Hard to compute justifications Requires a lot of entailment checkings – Too many unsatisfiability to look into We want to get into the core of the problem efficiently

Just. (A subClassOf Bot) Finding the Core Unsatisfiabilities Kalyanpur et al.’s root and derived unsatisfiable concepts – B is parent of A – A is derived – Non-derived unsatisfiable concept is root A derived concept can have alternative justification that contains no parent – Eliminating all root concepts do not necessarily eliminate all unsatisfiability Still need to compute justifications and entailment checkings Just. (B subClassOf Bot)

Finding the Core Unsatisfiabilities Type I and Type II unsatisfiable concepts – Purely based on the derivation relations between axioms – Suitable with a forward-chaining completion-based algorithm Type I concepts are full-unsatisfiable in reasoning Type II concepts are semi-unsatisfiable in reasoning – not immediately subsumed by all concepts – propagates Type II – Can become Type I if appropriate inference occurs axiom1 axiom2 axiom3 A subClassOf Bot B subClassOf Bot

Application on FMAs Repairing the Type I concepts will resolve all existing unsatisfiabilities – From TrOWL’s perspective Fewer enough Type I makes debugging much easier – E.g. 145 Type I in FMA Constitutional, only 0.43% of all the unsatisfiable concepts; 6 axioms directly involved, out of the 122,136 logical axioms

Summary and Future Work TrOWL and its syntactic approximation facility is well suited for the reasoning, metamodelling and debugging of the FMA ontologies – Striking a balance among expressiveness, performance and quality Future works – A completeness-guarantee? Why does TrOWL have high recalls on certain ontologies? A potential tractable DL that covers FMA family? – A fully-fledged completion-based reasoner for OWL2 DL? Will be intractable – Parallelisation? Changing CEL rules to ELK rules? Parallelising the additional approximate deduction rules – Improved entailment checking Currently using the dual-ontology classification algorithm from CEL Changing to a goal-driven algorithm?

Thank You!