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.

Highly Cited

2013

Highly Cited

2013

We present a real-world robotic agent that is capable of transferring grasping strategies across objects that share similar parts… Expand

Is this relevant?

2012

2012

The letter considers dynamics of helical vortices and helical-vortex rings either solving directly the equations of motions of a… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

There is a version of this in JSL but that version contains an error and is followed by an erratum. The erratum is encorporated… Expand

Is this relevant?

2006

2006

Universal algebra [5, 9, 4] is the theory of equalities t = u. It is a simple framework within which we can study mathematical… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

A boolean algebra is shown to be completely representable if and only if it is atomic, whereas it is shown that neither the class… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

For an arbitrary similarity type of Boolean Algebras with Operators we define a class ofSahlqvist identities. Sahlqvist… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

In this note we remark upon some relationships between the ideas of an approximation space and rough sets due to Pawlak ([9] and… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

Concurrent constraint programming [Sar89 ,SR90] is a simple and powerful model of concurrent computation based on the notions of… Expand

Is this relevant?

1990

1990

These are notes for a short course on relation algebras, nite-dimensional cylindric algebras, and their interconnections… Expand

Is this relevant?

Highly Cited

1984

Highly Cited

1984

Abstract It is shown how the theory of cylindric algebras (a notion introduced by Tarski and others as a tool in the… Expand

Is this relevant?