Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

��������� � �� ���������� Cyclic term graph rewriting has been shown to be adequate for simulating certain forms of infinitary… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

This article describes research into the discovery and modelling of emergent temporal phenomena in social networks. It summarizes… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

LEO-II is a standalone, resolution-based higher-order theorem prover designed for effective cooperation with specialist provers… Expand

Is this relevant?

2003

2003

We propose a graphical implementation for (possibly) recursive processes of the π-calculus, encoding each process into a term… Expand

Is this relevant?

2002

2002

This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial… Expand

Is this relevant?

1993

1990

1990

Term graphs are a natural generalization of terms in which structure sharing is allowed. Structure sharing makes term graph… Expand

Is this relevant?

1990

1990

We present a definition of term graph rewriting as the taking of a pushout in a category of partial morphisms, adapting the… Expand

Is this relevant?

1989

1989

A dichromatic polynomial for weighted graphs is presented. The Kauffman bracket of a signed graph, an invariant inspired by the… Expand

Is this relevant?

1985

1985

On etablit des conditions d'existence de circuits hamiltoniens dans des graphes, basees sur les degres des sommets et on formule… Expand

Is this relevant?