The logic system of concept graphs with negation
| Permalink: | http://skupni.nsk.hr/Record/fer.KOHA-OAI-FER:34770/TOC |
|---|---|
| Glavni autor: | Dau, Frithjof (-) |
| Vrsta građe: | Knjiga |
| Jezik: | eng |
| Impresum: |
Berlin ; New York :
Springer,
c2003.
|
| Nakladnička cjelina: |
Lecture notes in computer science ;
2892 |
| Predmet: | |
| Online pristup: |
Publisher description |
Sadržaj:
- Start Introduction Short Introduction to Existential Graphs Short Introduction to Conceptual Graphs Problems with Conceptual Graphs Short Introduction to Concept Graphs with Cuts Outline of This Treatise Acknowledgements.
- Basic Definitions Relational Graphs with Cuts Concept Graphs with Cuts.
- Alpha Overview for Alpha Semantics for Nonexistential Concept Graphs Calculus for Nonexistential Concept Graphs Calculus Remarks Theorems and Normal Forms Soundness and Completeness Soundness Completeness Dependencies and Independencies.
- Beta Overview for Beta First Order Logic Syntax Semantics Calculus.
- Semantics for Existential Concept Graphs Contexual Semantics Syntactical Translations Semantical Equivalence.
- Calculus for Existential Concept Graphs Calculus Derived Rules Soundness of the Calculus.
- Syntactical Equivalence to FOL.
- Summary of Beta Summary of Main Results Independency Results.
- Concept Graphs without Cuts Concept Graphs without Cuts Standard Models and Semantical Entailment Standard Graphs Transformation-Rules for Models Conclusion.
- Appendix Design Decisions Cuts Identity Links Dominating Nodes Peirce-Style Calculi.
- References.
- Index.