knowledge representation for the semantic web lecture 5
play

Knowledge Representation for the Semantic Web Lecture 5: Description - PowerPoint PPT Presentation

Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Knowledge Representation for the Semantic Web Lecture 5: Description Logics IV Daria Stepanova slides based on Reasoning Web 2011 tutorial


  1. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Knowledge Representation for the Semantic Web Lecture 5: Description Logics IV Daria Stepanova slides based on Reasoning Web 2011 tutorial “ Foundations of Description Logics and OWL ” by S. Rudolph Max Planck Institute for Informatics D5: Databases and Information Systems group WS 2017/18 1 / 40

  2. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Unit Outline Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning 2 / 40

  3. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Satisfaction and Satisfiability 3 / 40

  4. ❼ ❼ Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Satisfaction and Satisfiability of Knowledge Bases Satisfaction of a KB by an interpretation An interpretation I satisfies (or is a model of) a knowledge base K = �R , T , A� , if I satisfies every axiom of K , i.e., I | = α for α ∈ K . 4 / 40

  5. ❼ ❼ Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Satisfaction and Satisfiability of Knowledge Bases Satisfaction of a KB by an interpretation An interpretation I satisfies (or is a model of) a knowledge base K = �R , T , A� , if I satisfies every axiom of K , i.e., I | = α for α ∈ K . KB (un)satisfiability / (in)consistency A KB K is satisfiable (also: consistent), if it has some model; otherwise it is unsatisfiable (also: inconsistent or contradictory). 4 / 40

  6. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Satisfaction and Satisfiability of Knowledge Bases Satisfaction of a KB by an interpretation An interpretation I satisfies (or is a model of) a knowledge base K = �R , T , A� , if I satisfies every axiom of K , i.e., I | = α for α ∈ K . KB (un)satisfiability / (in)consistency A KB K is satisfiable (also: consistent), if it has some model; otherwise it is unsatisfiable (also: inconsistent or contradictory). ❼ unsatisfiability of a KB hints at a design bug ❼ unsatisfiable axioms carry no information: α is unsatisfiable ⇐ ⇒ ¬ α is tautologic (if negation is applicable), i.e., I | = ¬ α for every interpretation I 4 / 40

  7. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: KB Satisfiability RBox R owns ⊑ caresFor ”If somebody owns something, s/he cares for it.” TBox T Healthy ⊑ ¬ Dead ”Healthy beings are not dead.” Cat ⊑ Dead ⊔ Alive ”Every cat is dead or alive.” ⊑ ∃ owns . Cat ⊓ ∀ caresFor . Healthy HappyCatOwner ”A happy cat owner owns a cat and all beings he cares for are healthy.” ABox A HappyCatOwner ( schroedinger ) ”Schr¨ odinger is a happy cat owner.” Is K = �R , T , A� satisfiable? 5 / 40

  8. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: KB Satisfiability RBox R owns ⊑ caresFor ”If somebody owns something, s/he cares for it.” TBox T Healthy ⊑ ¬ Dead ”Healthy beings are not dead.” Cat ⊑ Dead ⊔ Alive ”Every cat is dead or alive.” ⊑ ∃ owns . Cat ⊓ ∀ caresFor . Healthy HappyCatOwner ”A happy cat owner owns a cat and all beings he cares for are healthy.” ABox A HappyCatOwner ( schroedinger ) ”Schr¨ odinger is a happy cat owner.” Is K = �R , T , A� satisfiable? Yes! 5 / 40

  9. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: KB Satisfiability TBox T Deer ⊑ Mammal ”Deers are mammals.” Mammal ⊓ Flies ⊑ Bat ”Mammals, who fly are bats.” Bat ⊑ ∀ worksFor . { batman } ”Bats work only for Batman” ABox A Deer ⊓ ∃ hasNose . Red ( rudolph ) ”Rudolph is a deer with a red nose.” ∀ worksFor − . ( ¬ Deer ⊔ Flies )( santa ) ”Only non-deers or fliers work for Santa.” worksFor ( rudolph , santa ) ”Rudolph works for Santa.” santa �≈ batman “Santa is different from Batman.” Is K satisfiable? 6 / 40

  10. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: KB Satisfiability TBox T Deer ⊑ Mammal ”Deers are mammals.” Mammal ⊓ Flies ⊑ Bat ”Mammals, who fly are bats.” Bat ⊑ ∀ worksFor . { batman } ”Bats work only for Batman” ABox A Deer ⊓ ∃ hasNose . Red ( rudolph ) ”Rudolph is a deer with a red nose.” ∀ worksFor − . ( ¬ Deer ⊔ Flies )( santa ) ”Only non-deers or fliers work for Santa.” worksFor ( rudolph , santa ) ”Rudolph works for Santa.” santa �≈ batman “Santa is different from Batman.” Is K satisfiable? No! 6 / 40

  11. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Entailment of Axioms Entailment checking A knowledge base K entails an axiom α (in symbols, K | = α ), if every model I of K satisfies α . models of K interpretations satisfying α ❼ Informally, K | = α elicits implicit knowledge ❼ If α occurs in K , then trivially K | = α ❼ If K is unsatisfiable, then K | = α for every axiom α 7 / 40

  12. ❼ ❼ ❼ Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: Entailment RBox R owns ⊑ caresFor ”If somebody owns something, s/he cares for it.” TBox T Healthy ⊑ ¬ Dead ”Healthy beings are not dead.” Cat ⊑ Dead ⊔ Alive ”Every cat is dead or alive.” HappyCatOwner ⊑ ∃ owns . Cat ⊓ ∀ caresFor . Healthy ”A happy cat owner owns a cat and all beings he cares for are healthy.” ABox A HappyCatOwner ( schroedinger ) ”Schr¨ odinger is a happy cat owner.” 8 / 40

  13. ❼ ❼ Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: Entailment RBox R owns ⊑ caresFor ”If somebody owns something, s/he cares for it.” TBox T Healthy ⊑ ¬ Dead ”Healthy beings are not dead.” Cat ⊑ Dead ⊔ Alive ”Every cat is dead or alive.” HappyCatOwner ⊑ ∃ owns . Cat ⊓ ∀ caresFor . Healthy ”A happy cat owner owns a cat and all beings he cares for are healthy.” ABox A HappyCatOwner ( schroedinger ) ”Schr¨ odinger is a happy cat owner.” ❼ K | = ∃ caresFor . ( Cat ⊓ Alive )( schroedinger ) ? 8 / 40

  14. ❼ Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: Entailment RBox R owns ⊑ caresFor ”If somebody owns something, s/he cares for it.” TBox T Healthy ⊑ ¬ Dead ”Healthy beings are not dead.” Cat ⊑ Dead ⊔ Alive ”Every cat is dead or alive.” HappyCatOwner ⊑ ∃ owns . Cat ⊓ ∀ caresFor . Healthy ”A happy cat owner owns a cat and all beings he cares for are healthy.” ABox A HappyCatOwner ( schroedinger ) ”Schr¨ odinger is a happy cat owner.” ❼ K | = ∃ caresFor . ( Cat ⊓ Alive )( schroedinger ) ❼ K | = ∀ owns . ¬ Cat ⊑ ¬ HappyCatOwner ? 8 / 40

  15. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: Entailment RBox R owns ⊑ caresFor ”If somebody owns something, s/he cares for it.” TBox T Healthy ⊑ ¬ Dead ”Healthy beings are not dead.” Cat ⊑ Dead ⊔ Alive ”Every cat is dead or alive.” HappyCatOwner ⊑ ∃ owns . Cat ⊓ ∀ caresFor . Healthy ”A happy cat owner owns a cat and all beings he cares for are healthy.” ABox A HappyCatOwner ( schroedinger ) ”Schr¨ odinger is a happy cat owner.” ❼ K | = ∃ caresFor . ( Cat ⊓ Alive )( schroedinger ) ❼ K | = ∀ owns . ¬ Cat ⊑ ¬ HappyCatOwner ❼ K | = Cat ⊑ Healthy ? 8 / 40

  16. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Example: Entailment RBox R owns ⊑ caresFor ”If somebody owns something, s/he cares for it.” TBox T Healthy ⊑ ¬ Dead ”Healthy beings are not dead.” Cat ⊑ Dead ⊔ Alive ”Every cat is dead or alive.” HappyCatOwner ⊑ ∃ owns . Cat ⊓ ∀ caresFor . Healthy ”A happy cat owner owns a cat and all beings he cares for are healthy.” ABox A HappyCatOwner ( schroedinger ) ”Schr¨ odinger is a happy cat owner.” ❼ K | = ∃ caresFor . ( Cat ⊓ Alive )( schroedinger ) ❼ K | = ∀ owns . ¬ Cat ⊑ ¬ HappyCatOwner ❼ K �| = Cat ⊑ Healthy 8 / 40

  17. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Decidability of DLs DLs are decidable, i.e., there exists an algorithm that Given: a KB and an axiom α , Output: “yes” iff KB | = α and no otherwise. ❼ Likewise, there is a similar algorithm that decides whether an input KB is satisfiable ❼ Just ask KB | = ⊤ ⊑ ⊥ : if the answer is “yes”, then KB is unsatisfiable, otherwise it is satisfiable. 9 / 40

  18. Satisfaction and Entailment Other Reasoning Problems Algorithmic Approaches to DL Reasoning Standard Reasoning Problems 10 / 40

Recommend


More recommend