08.03.2005IJCAI 2005 1 Reasoning with Inconsistent Ontologies Zhisheng Huang, Frank van Harmelen, and Annette ten Teije Vrije University Amsterdam.

Slides:



Advertisements
Similar presentations
Languages on the Semantic Web Frank van Harmelen Vrije Universiteit Amsterdam Ian Horrocks University of Manchester.
Advertisements

Anytime reasoning by Ontology Approximation S.Schlobach, E.Blaauw, M.El Kebir, A.ten Teije, F.van Harmelen, S.Bortoli, M.Hobbelman, K.Millian, Y.Ren, S.Stam,,
Kees van Deemter Matthew Stone Formal Issues in Natural Language Generation Lecture 4 Shieber 1993; van Deemter 2002.
Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
From Handbook of Temporal Reasoning in Artificial Intelligence By Jan Chomicki & David Toman Temporal Databases Presented by Leila Jalali CS224 presentation.
Ontologies and Databases Ian Horrocks Information Systems Group Oxford University Computing Laboratory.
Meta-logical problems: Knight, knaves, and Rips P.N. Johnson-Laird Princeton University Ruth M.J. Byrne University of Wales College of Cardiff Presented.
Level 1 Recall Recall of a fact, information, or procedure. Level 2 Skill/Concept Use information or conceptual knowledge, two or more steps, etc. Level.
Bounded Conjunctive Queries Yang Cao 1,2, Wenfei Fan 1,2, Tianyu Wo 2, Wenyuan Yu 3 1 University of Edinburgh, 2 Beihang University, 3 Facebook Inc.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Commonsense Reasoning and Argumentation 14/15 HC 10: Structured argumentation (3) Henry Prakken 16 March 2015.
Default Reasoning the problem: in FOL, universally-quantified rules cannot have exceptions –  x bird(x)  can_fly(x) –bird(tweety) –bird(opus)  can_fly(opus)
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Nonmonotonic Logic.
Inconsistencies, Negations and Changes in Ontologies Zhisheng Huang Vrije University Amsterdam The Netherlands Collaborative work with Giorgos Flouris.
Well-founded Semantics with Disjunction João Alcântara, Carlos Damásio and Luís Moniz Pereira Centro de Inteligência Artificial.
The International RuleML Symposium on Rule Interchange and Applications Local and Distributed Defeasible Reasoning in Multi-Context Systems Antonis Bikakis,
Everything You Need to Know (since the midterm). Diagnosis Abductive diagnosis: a minimal set of (positive and negative) assumptions that entails the.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
João Alcântara, Carlos Damásio and Luís Moniz Pereira Centro de Inteligência Artificial (CENTRIA) Depto. Informática,
Default and Cooperative Reasoning in Multi-Agent Systems Chiaki Sakama Wakayama University, Japan Programming Multi-Agent Systems based on Logic Dagstuhl.
December 1, 2006 Florencehttp:// 1 Dynamic Aspects of SEKT Legal Ontologies Zhisheng Huang, Stefan Schlobach, Frank van Harmelen Vrije.
Dynamic Ontologies on the Web Jeff Heflin, James Hendler.
China05 1 Reasoning with Inconsistent Ontologies 非协调本体的推理 Zhisheng Huang, Frank van Harmelen, and Annette ten Teije Vrije.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
ISWC2005http://sekt.semanticweb.org/ Reasoning with Multi-version Ontologies: a temporal logic approach Zhisheng Huang and Heiner Stuckenschmidt Vrije.
http://sekt.semanticweb.org/ WP3.4 Reasoning with Inconsistency Milestone 3.4 D3.4.3: Reasoning with Inconsistency (version 2). P/PU/Month 36.
How can Computer Science contribute to Research Publishing?
China 2009http:// 语义网与本体技术系列讲座 III 专题研究 Research Topics 黄智生 Zhisheng Huang Vrije University Amsterdam The Netherlands
11/8/20051 Ontology Translation on the Semantic Web D. Dou, D. McDermott, P. Qi Computer Science, Yale University Presented by Z. Chen CIS 607 SII, Week.
China.2005http://sekt.semanticweb.org/ Reasoning with Multi-version Ontologies: a temporal logic approach Zhisheng Huang and Heiner Stuckenschmidt Vrije.
OntoWeb SIG 2: Ontology Language Standards Heiner Stuckenschmidt Vrije Universiteit Amsterdam With contributions from: Ian Horrocks and Frank van Harmelen.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2010 Adina Magda Florea
Cooperative Query Answering Based on a talk by Erick Martinez.
Managing Large RDF Graphs (Infinite Graph) Vaibhav Khadilkar Department of Computer Science, The University of Texas at Dallas FEARLESS engineering.
Web Explanations for Semantic Heterogeneity Discovery Pavel Shvaiko 2 nd European Semantic Web Conference (ESWC), 1 June 2005, Crete, Greece work in collaboration.
BACKGROUND KNOWLEDGE IN ONTOLOGY MATCHING Pavel Shvaiko joint work with Fausto Giunchiglia and Mikalai Yatskevich INFINT 2007 Bertinoro Workshop on Information.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
The Bernays-Schönfinkel Fragment of First-Order Autoepistemic Logic Peter Baumgartner MPI Informatik, Saarbrücken.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Updating ABoxes in DL-Lite D. Calvanese, E. Kharlamov, W. Nutt, D. Zheleznyakov Free University of Bozen-Bolzano AMW 2010, May 2010.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
Majid Sazvar Knowledge Engineering Research Group Ferdowsi University of Mashhad Semantic Web Reasoning.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
A Quantitative Trust Model for Negotiating Agents A Quantitative Trust Model for Negotiating Agents Jamal Bentahar, John Jules Ch. Meyer Concordia University.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
22/07/11IJCAI 2011 Barcelona Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs Gerd Brewka (II, Leipzig) Paul E. Dunne (DCS, Liverpool)
30/03/'07 upd 01/04/08CmpE 588 Spring 2008 EMU1 Inferring with Ontologies Atilla ELÇİ Dept. of Computer Engineering Eastern Mediterranean University.
DEDUCTION PRINCIPLES AND STRATEGIES FOR SEMANTIC WEB Chain resolution and its fuzzyfication Dr. Hashim Habiballa University of Ostrava.
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
On the Semantics of Argumentation 1 Antonis Kakas Francesca Toni Paolo Mancarella Department of Computer Science Department of Computing University of.
EEL 5937 Content languages EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
WonderWeb. Ontology Infrastructure for the Semantic Web. IST WP4: Ontology Engineering Heiner Stuckenschmidt, Michel Klein Vrije Universiteit.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
On Abductive Equivalence Katsumi Inoue National Institute of Informatics Chiaki Sakama Wakayama University MBR
Distributed Instance Retrieval over Heterogeneous Ontologies Andrei Tamilin (1,2) & Luciano Serafini (1) (1) ITC-IRST (2) DIT - University of Trento Trento,
Zlatan Dragisic, Patrick Lambrix and Eva Blomqvist
A Kernel Revision Operator for Terminologies Algorithms and Evaluation
University of Montpellier, France.
Jie Bao, Doina Caragea and Vasant G Honavar
EA C461 – Artificial Intelligence Logical Agent
Knowledge Representation
Updating TBoxes in DL-Lite
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Computer Science cpsc322, Lecture 20
Test-Driven Ontology Development in Protégé
ece 720 intelligent web: ontology and beyond
Semantic Resolution in a Simple E-Commerce Application
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Presentation transcript:

IJCAI Reasoning with Inconsistent Ontologies Zhisheng Huang, Frank van Harmelen, and Annette ten Teije Vrije University Amsterdam

IJCAI Outline of This Talk Inconsistency in the Semantic Web General Framework Strategies and Algorithms Implementation Tests and Evaluation Future work and Conclusion

IJCAI Inconsistency and the Semantic Web The Semantic Web is characterized by scalability, distribution, and multi-authorship All these may introduce inconsistencies.

IJCAI Ontologies will be inconsistent Because of: mistreatment of defaults polysemy migration from another formalism integration of multiple sources … (“Semantic Web as a wake-up call for KR”)

IJCAI Example: Inconsistency by mistreatment of default rules MadCow Ontology Cow  Vegetarian MadCow  Cow MadCow   Eat.BrainofSheep Sheep  Animal Vegetarian   Eat.  (Animal  PartofAnimal) Brain  PartofAnimal theMadCow  MadCow...

IJCAI Example: Inconsistency through imigration from other formalism DICE Ontology Brain  CentralNervousSystem Brain  BodyPart CentralNervousSystem  NervousSystem BodyPart   NervousSystem

IJCAI Inconsistency and Explosion The classical entailment is explosive: P, ¬ P |= Q Any formula is a logical consequence of a contradiction. The conclusions derived from an inconsistent ontology using the standard reasoning may be completely meaningless

IJCAI Two main approaches to deal with inconsistency Inconsistency Diagnosis and Repair Ontology Diagnosis(Schlobach and Cornet 2003) Reasoning with Inconsistency Paraconsistent logics Limited inference (Levesque 1989) Approximate reasoning(Schaerf and Cadoli 1995) Resource-bounded inferences(Marquis et al.2003) Belief revision on relevance (Chopra et al. 2000)

IJCAI What an inconsistency reasoner is expected Given an inconsistent ontology, return meaningful answers to queries. General solution: Use non-standard reasoning to deal with inconsistency  |=  : the standard inference relations  |  : nonstandard inference relations

IJCAI Reasoning with inconsistent ontologies: Main Idea Starting from the query, 1.select consistent sub-theory by using a relevance-based selection function. 2.apply standard reasoning on the selected sub-theory to find meaningful answers. 3.If it cannot give a satisfying answer, the selection function would relax the relevance degree to extend consistent sub-theory for further reasoning.

IJCAI New formal notions are needed New notions: Accepted: Rejected: Overdetermined: Undetermined: Soundness: (only classically justified results) Meaningfulness: (sound & never overdetermined) soundness +

IJCAI Selection Functions Given an ontology T and a query , a selection function s(T, ,k) returns a subset of the ontology at each step k>0.

IJCAI General framework Use selection function s(T, ,k), with s(T, ,k)  s(T, ,k+1) 1.Start with k=0: s(T, ,0) |   or s(T, ,0) |   ? 2.Increase k, until s(T, ,k) |   or s(T, ,k) |   3.Abort when undetermined at maximal k overdetermined at some k

IJCAI Inconsistency Reasoning Processing: Linear Extension

IJCAI Proposition: Linear Extension Never over-determined May undetermined Always sound Always meaningful...

IJCAI Direct Relevance and K Relevance Direct relevance (0-relevance). there is a common name in two formulas: C(  )  C(  )   R(  )  R(  )   I(  )  I(  ) . K-relevance: there exist formulas  0,  1,…,  k such that  and  0,  0 and  1, …,  k and  are directly relevant.

IJCAI Relevance-based Selection Functions s(T, ,0)=  s(T, ,1)= {  T:  is directly relevant to  }. s(T, ,k)= {  T:  is directly relevant to s(T, ,k-1)}.

IJCAI PION Prototype PION: Processing Inconsistent ONtologies

IJCAI Answer Evaluation Intended Answer (IA): PION answer = Intuitive Answer Cautious Answer (CA): PION answer is ‘undetermined’, but intuitive answer is ‘accepted’ or ‘rejected’. Reckless Answer (RA): PION answer is accepted’ or ‘rejected’, but intuitive answer is ‘undetermined’. Counter Intuitive Answer (CIA): PION answer is ‘accepted’ but intuitive answer is ‘rejected’, or vice verse.

IJCAI Preliminary Tests with Syntactic-relevance Selection Function OntologyQueriesIACARACIAIA (%) ICR (%) Bird Brain (DICE) Married Woman MadCow

IJCAI Observation Intended answers include many undetermined answers. Some counter-intuitive answers Reasonably good performance

IJCAI Intensive Tests on PION Evaluation and test on PION with several realistic ontologies: Communication Ontology Transportation Ontology MadCow Ontology Each ontology has been tested by thousands of queries with different selection functions.

IJCAI Conclusions we proposed a general framework for reasoning with inconsistent ontologies based on selecting ever increasing consistent subsets choice of selection function is crucial query-based selection functions are flexible to find intended answers simple syntactic selection works surprisingly well

IJCAI Future Work understand better why simple selection functions work so well consider other selection functions(e.g. exploit more the structure of the ontology) Variants of strategies More tests on realistic ontologies Integrating with the diagnosis approach