TY  - BOOK
AU  - Dau,Frithjof
ED  - SpringerLink (Online service)
TI  - The Logic System of Concept Graphs with Negation: And Its Relationship to Predicate Logic 
T2  - Lecture Notes in Computer Science,
SN  - 9783540400622
AV  - Q334-342 
U1  - 006.3 23
PY  - 2003///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computational complexity
KW  - Artificial intelligence
KW  - Computer Science
KW  - Artificial Intelligence (incl. Robotics)
KW  - Computer Science, general
KW  - Mathematical Logic and Formal Languages
KW  - Discrete Mathematics in Computer Science
N1  - Start -- 1 Introduction -- 2 Basic Definitions -- Alpha -- 3 Overview for Alpha -- 4 Semantics for Nonexistential Concept Graphs -- 5 Calculus for Nonexistential Concept Graphs -- 6 Soundness and Completeness -- Beta -- 7 Overview for Beta -- 8 First Order Logic -- 9 Semantics for Existential Concept Graphs -- 10 Calculus for Existential Concept Graphs -- 11 Syntactical Equivalence to FOL -- 12 Summary of Beta -- 13 Concept Graphs without Cuts -- 14 Design Decisions
N2  - The aim of contextual logic is to provide a formal theory of elementary logic, which is based on the doctrines of concepts, judgements, and conclusions. Concepts are mathematized using Formal Concept Analysis (FCA), while an approach to the formalization of judgements and conclusions is conceptual graphs, based on Peirce's existential graphs. Combining FCA and a mathematization of conceptual graphs yields so-called concept graphs, which offer a formal and diagrammatic theory of elementary logic. Expressing negation in contextual logic is a difficult task. Based on the author's dissertation, this book shows how negation on the level of judgements can be implemented. To do so, cuts (syntactical devices used to express negation) are added to concept graphs. As we can express relations between objects, conjunction and negation in judgements, and existential quantification, the author demonstrates that concept graphs with cuts have the expressive power of first-order predicate logic. While doing so, the author distinguishes between syntax and semantics, and provides a sound and complete calculus for concept graphs with cuts. The author's treatment is mathematically thorough and consistent, and the book gives the necessary background on existential and conceptual graphs
UR  - http://dx.doi.org/10.1007/b94030
ER  -