A conceptual graph (CG) is a graph representation for logic based on the semantic networks
of artificial intelligence and the existential graphs of Charles Sanders Peirce. CG design …

A conceptual graph (CG) is a graph representation for logic based on the semantic networks
of artificial intelligence and the existential graphs of Charles Sanders Peirce. The ISO …

We introduceatomic flows': they are graphs obtained from derivations by tracing atom
occurrences and forgetting the logical structure. We study simple manipulations of atomic …

A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the
abstract representation of cut-free proofs modulo inessential rule commutation. The only …

In this paper we explore the design of sequent calculi operating on graphs. For this purpose,
we introduce logical connectives allowing us to extend the well-known correspondence …

A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the
abstract representation of cut-free proofs modulo inessential rule commutation. The only …

Theorem provers produce evidence of proof in many different formats, such as proof scripts,
natural deductions, resolution refutations, Herbrand expansions, and equational rewritings …

The sequent calculus is often criticized for requiring proofs to contain large amounts of low-
level syntactic details that can obscure the essence of a given proof. Because each …

Proofs Without Syntax [Hughes, DJD Proofs Without Syntax. Annals of Mathematics 2006 (to
appear), http://arxiv. org/abs/math/0408282 (v3). August 2004 submitted version also …

In this paper we present a proof system that operates on graphs instead of formulas. We
begin our quest with the well-known correspondence between formulas and cographs …