Propagating truth and detecting contradiction in conceptual graph databases
In our ICCS95 paper, An Implementation Model for Contexts and Negation in Conceptual Graphs, we made some important advances relative to storing conceptual graphs in a generalization hierarchy. These included a simplified definition of both Formation and Inference Rules, a mechanism for storing nested, negative contexts, an extension to Method III for updating the database and truth values, a further extension to propagate some inferences, and a mechanism for representing and sometimes detecting contradictions. In this paper we show how to use properties of lattices and a context sensitive superresolution inference rule to propagate truth values in a database of nested, possibly negated, conceptual graphs and, as this is done, detect any consequent contradictions.
We show how a combination of adding data to the nodes and links of the CG hierarchy, maintaining the hierarchy as a lattice, inserting graphs insideout, and precomputing some values during earlier phases, leads to provably complete and more efficient algorithms than we described last year. An example is carried through the explanation of these new features to illustrate each. And, after the updated algorithm is presented, an efficient lattice based superresolution theorem proof procedure is presented.
An inductive proof is given that our insertion algorithm is also a proof procedure that retains consistency and completeness or detects contradiction. In first order databases, consistency and completeness are with respect to provability rather than truth.
KeywordsConceptual Graphs Generalization Hierarchy Logic Proof Procedure Refutation Resolution Contradiction
Unable to display preview. Download preview PDF.
- 1.G. Ellis. Compiled hierarchical retrieval. In E. Way, editor, Proceedings of Sixth Annual Workshop on Conceptual Structures, pages 187–208, SUNY-Binghamton, 1991.Google Scholar
- 2.G. Ellis. Efficient retrieval from hierarchies of objects using lattice operations. In G. Mineau and B. Moulin, editors, Proceedings of First International Conference on Conceptual Structures (ICCS-93), Montreal, 1993.Google Scholar
- 3.G. Ellis and F. Lehmann. Exploiting the Induced Order on Type-labeled Graphs for Fast Knowledge Retrieval. In Conceptual Structures: Current Practices, the proceedings of the Second International Conference on Conceptual Structures, ICCS'94, College Park, Maryland, USA, Springer-Verlag, August, 1994.Google Scholar
- 4.G. Ellis. Object-Oriented Conceptual Graphs In Proceedings of Third International Conference on Conceptual Structures, ICCS'95, Santa Cruz, CA, USA, August, 1995, pages 144–157, Springer-Verlag, New York.Google Scholar
- 5.J. Esch and R. Levinson. An Implementation Model for Contexts and Negation in Conceptual Graphs. In Proceedings of Third International Conference on Conceptual Structures, ICCS'95, Santa Cruz, CA, USA, August, 1995, pages 247–262, Springer-Verlag, New York.Google Scholar
- 6.H. B. Enderton. A Mathematical Introduction to Logic Academic Press, N.Y., 1972.Google Scholar
- 7.R. Levinson. Pattern associativity and the retrieval of semantic networks. Computers and Mathematics with Applications, 23(6–9):573–600, 1992. Part 2 of Special Issue on Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor. Also in Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor, Pergammon Press, 1992.Google Scholar
- 8.Levinson & Ellis. Multilevel hierarchical retrieval. Knowledge-Based Systems, 1992.Google Scholar
- 9.R. Levinson and Karplus K. Graph-isomorphism and experience-based planning. In D. Subramaniam, editor, Proceedings of Workshop on Knowledge Compilation and Speed-Up Learning, Amherst, MA., June 1993.Google Scholar
- 10.R.A. Levinson. Exploiting the physics of state-space search. In Proceedings of AAAI Symposium on Games:Planning and Learning, pages 157–165. AAAI Press, 1993.Google Scholar
- 11.R. Levinson. UDS: A Universal Data Structure. In Proceedings of Second International Conference on Conceptual Structures, ICCS'94, College Park, Maryland, Aug. 1994.Google Scholar
- 12.Z. Manna and I.A. Waldinger, Deductive Approach to Program Synthesis, In ACM Transactions on Programming Languages and Systems, Vol. 2, No. 1, January 1980.Google Scholar
- 13.T.M. Mitchell, Generalization as Search, In Artificial Intelligence, Vol 18, 1982.Google Scholar
- 14.W. McCune, OTTER 3.0 Reference Manual and Guide, Argonne National Laboratory, Argonne, Illinois, 1995.Google Scholar
- 15.E. Rich and K. Knight. Artificial Intelligence, McGraw-Hill, 1991.Google Scholar
- 16.D.D. Roberts. The existential graphs. In Semantic Networks in Artificial Intelligence, pages 639–664, Roberts, 1992.Google Scholar
- 17.J.F. Sowa. Conceptual Structures. Addison-Wesley, 1984.Google Scholar
- 18.J.F. Sowa. Conceptual Graphs Summary. In Conceptual Structures: Current Research and Practice, T. Nagle et. al. Ed., Ellis Horwood, 1992.Google Scholar
- 19.J.F. Sowa. Logical Foundations for Representing Ojbect-Oriented Systems In Journal of Experimental & Theoretical Artifical Intelligence, 5, 1993.Google Scholar
- 20.J.F. Sowa. Knowledge Representation: Logical, Philosophical, and Computational Foundations. Book in preparation. To be published by PWS Publishing Company, Boston, Massachusetts.Google Scholar
- 21.J. Stewart. Theorem Proving Using Existential Graphs, Master's Thesis, available as University of California Technical Report.Google Scholar
- 22.C.B. Suttner and G. Sutcliffe, The TPTP Problem Library, Technical Report AR-95-03, Institut für Informatik, TU München, Germany, 1995.Google Scholar