Abstract
We start our investigations with nonexistential concept graphs with cuts, i.e., concept graphs without generic markers. The approach for nonexistential concept graphs with cuts is straight forward: It is based on syntax, semantics, and a calculus which is sound and complete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dau, F. (2003). 3 Overview for Alpha. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-40062-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20607-1
Online ISBN: 978-3-540-40062-2
eBook Packages: Springer Book Archive