Query Graphs with Cuts: Mathematical Foundations

Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with Negations’, conceptual graphs are elaborated mathematically, and the cuts of existential graphs are added to them. This yields the system of concept graphs with cuts. These graphs correspond to the closed formulas of first order predicate logic. Particularly, concept graphs are propositions which are evaluated to truth-values. In this paper, concept graphs are extended to so-called query graphs, which are evaluated to relations instead. As the truth-values TRUE and FALSE can be understood as the two 0-ary relations, query graphs extend the expressiveness of concept graphs. Query graphs can be used to elaborate the logic of relations. In this sense, they bridge the gap between concept graphs and the Peircean Algebraic Logic, as it is described in Burch’s book ’A Peircean Reduction Thesis’. But in thi...

• Type: Conference
• Year: 2004
• Where: DIAGRAMS
• Authors: Frithjof Dau
• Keywords: Artificial Intelligence, Concept Graphs, Conceptual Graphs, DIAGRAMS 2004, Query Graphs