Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Conceptual structures
Knowledge representation: logical, philosophical and computational foundations
Knowledge representation: logical, philosophical and computational foundations
Logic and Visual Information
Reconstituting Beta Graphs into an Efficacious System
Journal of Logic, Language and Information
Negations in Simple Concept Graphs
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Concept Graphs and Predicate Logic
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Constants and Functions in Peirce's Existential Graphs
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Some notes on proofs with alpha graphs
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
| Hi-index | 0.00 |
Conceptual graphs are based on the existential graphs of Peirce and the semantic networks of AI (see [So92]). Existential graphs are composed of three syntactical elements: lines of identity, predicate names and cuts (which are used for negation). In [Da00] and [Da01] we introduced the cuts of existential graphs as new syntactical element to concept graphs. The resulting concept graphs with cuts have at least the expressivity of existential graphs. In this article, we present some ideas how existential graphs can be translated to concept graphs with cuts, or, in other words, how existential graphs can be regarded as special concept graphs with cuts. In order to do this, we provide several examples of existential graphs. We discuss the meanings of these examples and how they should be translated to concept graphs with cuts. After the discussion, we attempt to provide a formal definition of existential graphs and a formal definition of their translation to concept graphs with cuts.