Skip to main content
SpringerLink
Log in
Book cover

International Conference on Conceptual Structures

ICCS 1995: Conceptual Structures: Applications, Implementation and Theory pp 247–262Cite as

An implementation model for contexts and negation in conceptual graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 954))

Abstract

An implementation model for a retrieval and inference system based on the theory of conceptual graphs is presented. Several hard issues related to the full implementation of the theory are taken up and solutions presented. The solutions attempt to exploit existing but not fully recognized symmetries in CG theory. These symmetries include those between formation and inference rules, AND and OR, positive and negative, copy and restrict, general and specific, etc. Topics taken up include the implementation of Sowa's formation rules, the storage of a conceptual graph hierarchy involving contexts and negation as a conjunctive normal form (CNF) lattice, the extension of existing retrieval algorithms, such as Levinson's Method III and UDS, to handle complex referents and nested contexts, the checking of consistency, and the definition of Peirce's inference rules in terms of formation rules. A distinction is made between syntactic implication and semantic implication. The issues tackled in the paper lay the foundation for a full scale graph-based first-order logic theorem prover.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Boley. Pattern associativity and the retrieval of semantic networks. Computers and Mathematics with Applications, 23(6–9):601–638, 1992. Part 2 of Special Issue on Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor.

    Google Scholar 

  2. M. Chein and M.L. Mugnier. Conceptual Graphs: Fundamental Notions In Revue d'Intelligence Artificielle, n14, 1992, pp365–406.

    Google Scholar 

  3. 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 

  4. 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 

  5. G. Ellis and R. Levinson. Proceedings of the Fourth International Workshop on Peirce: A Conceptual Graph Workbench. In association with the Second International Conference on Conceptual Structures, ICCS'94, College Park, Maryland, USA, August 19, 1994.

    Google Scholar 

  6. G. Ellis and F. Lehmann. Exploiting the Induced Order on Type-labeled Graphs for Fast Knowledge Retrieval. In W.M. Tepfenhart, J.P. Dick and J.F. Sowa editors 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 

  7. J.W. Esch. Contexts as White Box Concepts. In Supplemental Proceedings of First International Conference on Conceptual Structures: Theory and Application, Quebec City, Canada, August 4–7, 1993, pages 17–29.

    Google Scholar 

  8. J.W. Esch. Contexts and Concepts: Abstraction Duals. In em Proceedings of Second International Conference on Conceptual Structures, ICCS'94, College Park, Maryland, USA, August 1994, pages 175–184.

    Google Scholar 

  9. J.W. Esch. Contexts, Canons and Coreferent Types. In em Proceedings of Second International Conference on Conceptual Structures, ICCS'94, College Park, Maryland, USA, August 1994, pages 185–195.

    Google Scholar 

  10. B. Goertzel. Chaotic logic: language, thought, and reality from the perspective of complex systems science In IFSR International Series on Systems Science and Engineering v.9., Plenum Press, New York, 1994

    Google Scholar 

  11. J.A. Goguen and F.J. Varela. Systems and Distinctions: Duality and Complementarity. In International Journal of Systems, 5(1):31–43, 1979.

    Google Scholar 

  12. J. Gould and R. Levinson. Experience-based adaptive search. In Machine Learning:A Multi-Strategy Approach, volume 4. Morgan Kauffman, 1992.

    Google Scholar 

  13. R. Levinson. A self-organizing retrieval system for graphs. In AAAI-84, pages 203–206. Morgan Kaufman, 1984.

    Google Scholar 

  14. 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 reprinted on pages 573–600 of the book, Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor, Pergammon Press, 1992.

    Google Scholar 

  15. R. Levinson and G. Ellis. Multilevel hierarchical retrieval. Knowledge-Based Systems, 1992.

    Google Scholar 

  16. 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 

  17. 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 

  18. R. Levinson. UDS: A Universal Data Structure. In Proceedings of Second International Conference on Conceptual Structures, ICCS'94, College Park, Maryland, USA, August 1994, pages 230–250.

    Google Scholar 

  19. D.D. Roberts. The existential graphs. In Semantic Networks in Artificial Intelligence, pages 639–664. Roberts, 1992.

    Google Scholar 

  20. E. Sciore. A complete axiomatization for join dependencies. JACM, 29(2):373–393, April 1982.

    Google Scholar 

  21. J.F. Sowa. Conceptual Structures. Addison-Wesley, 1984.

    Google Scholar 

  22. J.F. Sowa. Conceptual Graphs Summary. In Conceptual Structures: Current Research and Practice, T. Nagle et. al. Ed., Ellis Horwood, 1992.

    Google Scholar 

  23. J.F. Sowa. Knowledge Representation: Logical, Philosophical, and Computational Foundations. Book in preparation. To be published by PWS Publishing Company, Boston, Massachusetts.

    Google Scholar 

  24. M. Willems. Generalization of Conceptual Graphs. In Proceedings of Sixth Annual Workshop on Conceptual Graphs, Binghamton, New York, State Univ. of New York, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Unisys Government Systems Group, P.O. Box 64525 U1T23, 55164, St. Paul, MN

    John Esch

  2. Department of Computer and Information Sciences, University of California, 225 Applied Sciences Building, 95064, Santa Cruz, CA

    Robert Levinson

Authors
  1. John Esch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Levinson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerard Ellis Robert Levinson William Rich John F. Sowa

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Esch, J., Levinson, R. (1995). An implementation model for contexts and negation in conceptual graphs. In: Ellis, G., Levinson, R., Rich, W., Sowa, J.F. (eds) Conceptual Structures: Applications, Implementation and Theory. ICCS 1995. Lecture Notes in Computer Science, vol 954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60161-9_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-60161-9_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60161-6

  • Online ISBN: 978-3-540-49539-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation