Results 1  10
of
896
Topological Constructions in the oGraph Calculus
, 2000
"... Benedetti and Petronio developed in [1] a so called oGraph Calculus, where a compact oriented 3manifold with nonempty boundary could be described by a quadrivalent graph together with some extra structure. In this paper, we will show how topological constructions such as puncturing, connected sums ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Benedetti and Petronio developed in [1] a so called oGraph Calculus, where a compact oriented 3manifold with nonempty boundary could be described by a quadrivalent graph together with some extra structure. In this paper, we will show how topological constructions such as puncturing, connected
On a Graph Calculus for Algebras of Relations?
"... Abstract. We present a sound and complete logical system for deriving inclusions between graphs from inclusions between graphs, taken as hypotheses. Graphs provide a natural tool for expressing relations and reasoning about them. Here we extend this system to a sound and complete one to cope with ..."
Abstract
 Add to MetaCart
language, reasoning from hypotheses, graph calculus, completeness, complementation.
A DEFINITION OF DESCENDANTS AT ONE POINT IN GRAPH CALCULUS
, 2005
"... Abstract. This paper is a sequel to [7], and we expect the reader to have some knowledge of [7]. In terms of graph calculus developed in [7], we give a definition of descendants at one point. Then we prove that our definition satisfies the topological recursion relations in genera 0, 1, and 2, strin ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. This paper is a sequel to [7], and we expect the reader to have some knowledge of [7]. In terms of graph calculus developed in [7], we give a definition of descendants at one point. Then we prove that our definition satisfies the topological recursion relations in genera 0, 1, and 2
A HigherOrder Graph Calculus for Autonomic Computing
 GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT. A CONFERENCE CELEBRATING MARTIN CHARLES GOLUMBIC'S 60TH BIRTHDAY (2008)
, 2008
"... In this paper, we present a highlevel formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We argue that this formalism is suitable for modeling autonomic systems and briefly illustrate its expressivity for modeling properties of such systems. ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In this paper, we present a highlevel formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We argue that this formalism is suitable for modeling autonomic systems and briefly illustrate its expressivity for modeling properties of such systems.
Closing Boundary Components and Seifert Manifolds in the oGraph Calculus
"... Benedetti and Petronio developed in [1] a so called oGraph Calculus, where a compact oriented 3manifold with nonempty boundary could be described by a quadrivalent graph together with some extra structure. Using this calculus, we will show how to glue in a full cylinder along an embedded closed cu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Benedetti and Petronio developed in [1] a so called oGraph Calculus, where a compact oriented 3manifold with nonempty boundary could be described by a quadrivalent graph together with some extra structure. Using this calculus, we will show how to glue in a full cylinder along an embedded closed
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
of two given graphs is isomorphic to a subgraph of the second. Other examples are discussed. A method of measuring the complexity of proof procedures for the predicate calculus is introduced and discussed. Throughout this paper, a set of strings 1 means a set of strings on some fixed, large, finite
Snake graph calculus and cluster algebras from surfaces II: Selfcrossing . . .
, 2014
"... Snake graphs appear naturally in the theory of cluster algebras. For cluster algebras from surfaces, each cluster variable is given by a formula which is parametrized by the perfect matchings of a snake graph. In this paper, we continue our study of snake graphs from a combinatorial point of view. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Snake graphs appear naturally in the theory of cluster algebras. For cluster algebras from surfaces, each cluster variable is given by a formula which is parametrized by the perfect matchings of a snake graph. In this paper, we continue our study of snake graphs from a combinatorial point of view
c © Veloso & Veloso This work is licensed under the Creative Commons Attribution License. A Graph Calculus for Predicate Logic∗
"... We introduce a refutation graph calculus for classical firstorder predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents ⊥. Our calculus establishes that a graph ..."
Abstract
 Add to MetaCart
We introduce a refutation graph calculus for classical firstorder predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents ⊥. Our calculus establishes that a
found at the ENTCS Macro Home Page. A Port Graph Calculus for Autonomic Computing and Invariant Verification
, 2009
"... with entcsmacro.sty for your meeting. Both can be ..."
Results 1  10
of
896