1055 search results - page 32 / 211 » Enumerations in computable structure theory |
DIS
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. State of the art equation discovery systems start the discovery process from scratch, rather than from an initial hypothesis in the space of equations. On the other hand,...
CADE
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
GIS
2006
ACM
14 years 11 months ago
2006
ACM
In this paper we describe work on the automatic recognition of island structures. In an initial phase several test persons were asked to mark groups of islands that they perceived...
SIAMCOMP
1998
13 years 9 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...