Advertisement

Automatic Strengthening of Graph-Structured Knowledge Bases

Or: How to Identify Inherited Content in Concept Graphs
  • Vinay Chaudhri
  • Nikhil Dinesh
  • Stijn Heymans
  • Michael Wessel
Conference paper
  • 725 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8323)

Abstract

We consider the problem of identifying inherited content in knowledge representation structures called concept graphs (CGraphs). A CGraph is a visual representation of a concept; in the following, CGraphs and concepts are used synonymously. A CGraph is a node- and edge-labeled directed graph. Labeled (binary) edges represent relations between nodes, which are considered instances of the concepts in their node labels. CGraphs are arranged in a taxonomy (is-a hierarchy). The taxonomy is a directed acyclic graph, as multiple inheritance is allowed. A taxonomy and set of CGraphs is called a graph-structured knowledge base (GSKB).

A CGraph can inherit content from other CGraphs – intuitively, if C and D are CGraphs, then C may contain content inherited from D, i.e. labeled nodes and edges “from D” can appear in C, if D is a direct or indirect superconcept of C, or if C contains a node being labeled with either D or some subclass of D. In both cases, C is said to refer to D.

This paper contains three contributions. First, we describe and formalize the problem from a logical point of view and give a first-order semantics for CGraphs. We show that the identification of inherited content in CGraphs depends on some form of hypothetical reasoning and is thus not a purely deductive inference task, as it requires unsound reasoning. Hence, this inference is different from the standard subsumption checking problem, as known from description logics (DLs) [1]. We show that the provenance problem (from where does a logical atom in a CGraph get inherited?) strongly depends on the solution to the co-reference problem (which existentials in the first-order axiomatization of concepts as formulas denote identical domain individuals?) We demonstrate that the desired inferences can be obtained from a so-called strengthened GSKB, which is an augmented variant of the input GSKB. We present an algorithm which augments and strengthens an input GSKB, using model-theoretic notions. Secondly, we are addressing the problem from a graph-theoretic point of view, as this perspective is closer to the actual implementation. We show that we can identify inherited content by computing so-called concept coverings, which induce inherited content from superconcepts by means of graph morphisms. We argue that the algorithm solves a challenging (NP-hard) problem. Thirdly, we apply the algorithm to the large-scale biological knowledge base from the AURA project [2], and present a preliminary evaluation of its performance.

Keywords

Prefer Model Equality Atom Concept Graph Concept Atom Relation Atom 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)Google Scholar
  2. 2.
    Gunning, D., Chaudhri, V.K., et al.: Project Halo Update - Progress Toward Digital Aristotle. AI Magazine (2010)Google Scholar
  3. 3.
    Reece, J.B., Urry, L.A., Cain, M.L., Wasserman, S.A., Minorsky, P.V., Jackson, R.B.: Campbell Biology, 9th edn. Pearson Education, Harlow (2011)Google Scholar
  4. 4.
    Chaudhri, V., Dinesh, N., et al.: Preliminary Steps Towards a Knowledge Factory Process. In: The Sixth International Conference on Knowledge Capture (2011)Google Scholar
  5. 5.
    Carpenter, B.: Skeptical and Credulous Default Unification with Applications to Templates and Inheritance. In: Inheritance, Defaults and the Lexicon, pp. 13–37. Cambridge University Press (1994)Google Scholar
  6. 6.
    Cohen, A.: Anaphora Resolution as Equality by Default. In: Branco, A. (ed.) DAARC 2007. LNCS (LNAI), vol. 4410, pp. 44–58. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Overholtzer, A., Spaulding, A., Chaudhri, V.K., Gunning, D.: Inquire: An Intelligent Textbook. In: Proceedings of the Video Track of AAAI Conference on Artificial Intelligence. AAAI (2012), http://www.aaaivideos.org/2012/inquire_intelligent_textbook/
  8. 8.
    Hedman, S.: A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity. Oxford Texts in Logic (2004)Google Scholar
  9. 9.
    Clark, P., Porter, B.: Building Concept Representations from Reusable Components. In: Proceedings of AAAI. AAAI Press (1997)Google Scholar
  10. 10.
    Chaudhri, V.K., Tran, S.C.: Specifying and Reasoning with Under-Specified Knowledge Base. In: International Conference on Knowledge Representation and Reasoning (2012)Google Scholar
  11. 11.
    Brachman, R.J., Levesque, H.J.: The Tractability of Subsumption in Frame-Based Description Languages. In: AAAI. AAAI Press (1984)Google Scholar
  12. 12.
    Haarslev, V., Möller, R.: The Revival of Structural Subsumption in Tableau-Based Description Logic Reasoners. In: International Workshop on Description Logics, DL 2008 (2008)Google Scholar
  13. 13.
    Baader, F.: Restricted Role-value-maps in a Description Logic with Existential Restrictions and Terminological Cycles. In: International Workshop on Description Logics, DL 2003 (2003)Google Scholar
  14. 14.
    Chein, M., Mugnier, M., Simonet, G.: Nested Graphs: A Graph-based Knowledge Representation Model with FOL Semantics. In: International Conference on Knowledge Representation, KR 1998. Morgan Kaufmann (1998)Google Scholar
  15. 15.
    Vardi, M.Y.: Why is Modal Logic so Robustly Decidable? In: Descriptive Complexity and Finite Models. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 31, pp. 149–184 (1996)Google Scholar
  16. 16.
    Motik, B., Cuenca Grau, B., Horrocks, I., Sattler, U.: Representing Ontologies Using Description Logics, Description Graphs, and Rules. Artif. Intell. 173, 1275–1309 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Grosof, B.: The SILK Project: Semantic Inferencing on Large Knowledge (2012), http://silk.semwebcentral.org/
  18. 18.
    Chaudhri, V.K., Heymans, S., Wessel, M., Son, T.C.: Query Answering in Object Oriented Knowledge Bases in Logic Programming: Description and Challenge for ASP. In: Proc. of 6th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), Istanbul, Turkey (2013)Google Scholar
  19. 19.
    Chaudhri, V.K., Wessel, M.A., Heymans, S.: KB_Bio_101: A Challenge for TPTP First-Order Reasoners. In: KInAR - Knowledge Intensive Automated Reasoning Workshop at CADE-24, the 24th International Conference on Automated Deduction, Lake Placid, New York, USA (2013)Google Scholar
  20. 20.
    W3C OWL Working Group: OWL 2 Web Ontology Language: Document Overview. W3C Recommendation (October 27, 2009), http://www.w3.org/TR/owl2-overview/
  21. 21.
    Horrocks, I., Kutz, O., Sattler, U.: The Even More Irresistible \(\mathcal{SROIQ}\). In: International Conference on Knowledge Representation and Reasoning (2006)Google Scholar
  22. 22.
    Chaudhri, V.K., Wessel, M.A., Heymans, S.: KB_Bio_101: A Challenge for OWL Reasoners. In: Proc. of 2nd OWL Reasoner Evaluation Workshop (ORE 2013), Ulm, Germany (2013)Google Scholar
  23. 23.
    Chaudhri, V.K., Heymans, S., Wessel, M.A.: The Bio_KB_101 Download Page (2012), http://www.ai.sri.com/halo/halobook2010/exported-kb/biokb.html

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Vinay Chaudhri
    • 1
  • Nikhil Dinesh
    • 1
  • Stijn Heymans
    • 1
  • Michael Wessel
    • 1
  1. 1.Artificial Intelligence CenterSRI InternationalMenlo ParkUSA

Personalised recommendations