A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
Olivier Devillers, Alexandra Fronville, Bernard Mo...
Let X be a smooth quadric of dimension 2m in P2m+1 C and let Y, Z X be subvarieties both of dimension m which intersect transversely. In this paper we give an algorithm for comput...
Sandra Di Rocco, David Eklund, Andrew J. Sommese, ...