Abstract
In this chapter, we will provide the calculus for existential concept graphs with cuts and a couple of derived rules. Furthermore we will show that the calculus is sound with respect to the semantics we presented in the last chapter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dau, F. (2003). 10 Calculus for Existential Concept Graphs. In: The Logic System of Concept Graphs with Negation. Lecture Notes in Computer Science(), vol 2892. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40062-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-40062-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20607-1
Online ISBN: 978-3-540-40062-2
eBook Packages: Springer Book Archive