Sciweavers

1071 search results - page 10 / 215
» Programming with enumerable sets of structures
Sort
View
ICANN
2010
Springer
13 years 9 months ago
Neuro-symbolic Representation of Logic Programs Defining Infinite Sets
It has been one of the great challenges of neuro-symbolic integration to represent recursive logic programs using neural networks of finite size. In this paper, we propose to imple...
Ekaterina Komendantskaya, Krysia Broda, Artur S. d...
ICALP
2001
Springer
14 years 1 months ago
Combinatorics of Periods in Strings
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
Eric Rivals, Sven Rahmann
DCC
2001
IEEE
14 years 8 months ago
The Invariants of the Clifford Groups
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
DNA
2009
Springer
194views Bioinformatics» more  DNA 2009»
14 years 13 days ago
A Domain-Specific Language for Programming in the Tile Assembly Model
We introduce a domain-specific language (DSL) for creating sets of tile types for simulations bstract Tile Assembly Model. The language defines objects known as tile templates, wh...
David Doty, Matthew J. Patitz
JELIA
2004
Springer
14 years 1 months ago
A System with Template Answer Set Programs
Abstract. Although ASP systems have been extended in many directions, they still miss features which may be helpful towards industrial applications, like capabilities of quickly in...
Francesco Calimeri, Giovambattista Ianni, Giuseppe...