Sciweavers

513 search results - page 12 / 103
» Finitely Based, Finite Sets of Words
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...
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
14 years 3 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
INFORMATICALT
2002
140views more  INFORMATICALT 2002»
13 years 8 months ago
Intelligent Initial Finite Element Mesh Generation for Solutions of 2D Problems
The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on ...
Lina Vasiliauskiene, Romualdas Bausys
AML
2008
53views more  AML 2008»
13 years 8 months ago
Pairs, sets and sequences in first-order theories
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
Albert Visser
SIAMJO
2008
87views more  SIAMJO 2008»
13 years 8 months ago
Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
Using variational analysis, we study the linear regularity for a collection of finitely many closed sets. In particular, we extend duality characterizations of the linear regularit...
Xi Yin Zheng, Kung Fu Ng