Related papers: Set systems: order types, continuous nondeterminis…
Continual Learning (CL) is a field dedicated to devise algorithms able to achieve lifelong learning. Overcoming the knowledge disruption of previously acquired concepts, a drawback affecting deep learning models and that goes by the name of…
We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class C of finite structures that can be…
A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the…
We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…
Recent work in NLP shows that LSTM language models capture hierarchical structure in language data. In contrast to existing work, we consider the \textit{learning} process that leads to their compositional behavior. For a closer look at how…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
We study phase transitions and the nature of order in a class of classical generalized $O(N)$ nonlinear $\sigma$-models (NLS) constructed by minimally coupling pure NLS with additional degrees of freedom in the form of (i) Ising…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
In this paper, based on results of exact learning and test theory, we study arbitrary infinite binary information systems each of which consists of an infinite set of elements and an infinite set of two-valued functions (attributes) defined…
A description of the environment cognition process by intelligent systems with a fixed set of system goals is suggested. Such a system is represented by the set of its goals only without any models of the system elements or the environment.…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
On-line and batch learning of a perceptron in a discrete weight space, where each weight can take $2 L+1$ different values, are examined analytically and numerically. The learning algorithm is based on the training of the continuous…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
Continual learning, the ability of a model to adapt to an ongoing sequence of tasks without forgetting earlier ones, is a central goal of artificial intelligence. To better understand its underlying mechanisms, we study the limitations of…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
Recently, there has been an increasing interest in modelling and computation of physical systems with neural networks. Hamiltonian systems are an elegant and compact formalism in classical mechanics, where the dynamics is fully determined…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable…
This survey synthesizes the principal descriptive set-theoretic perspectives on deterministic Cantor sets on the real line and charts directions for future study. After recounting their historical genesis and compiling an up-to-date…
The vector field of a mixed-monotone system is decomposable via a decomposition function into increasing (cooperative) and decreasing (competitive) components, and this decomposition allows for, e.g., efficient computation of reachable sets…