Trepo - Selaus tekijän mukaan "Kuusisto, Antti"

Uniform one-dimensional fragment UF is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in ...

This thesis examined cooperation and contract models in complex project networks. The motivation to conduct this research originated from challenging projects that had included struggles with contractor cooperation and ...

This article is a brief, user friendly discourse on extensions of multi- modal logics with operations on modalities. Such logics are considered from a general point of view with the emphasis on the theory of deduc- tion ...

In this brief technical report we sketch a semantics for first-order logic with generalized quantifi ers based on double teams. We also defi ne the notion of a generalized atom. Such atoms can be used in order to defi ne ...

<p>We consider distributed algorithms in the realistic scenario where distributed message passing is operated by circuits. We show that within this setting, modal substitution calculus MSC precisely captures the ...

We investigate the descriptive complexity of a class of neural networks with unrestricted topologies and piecewise polynomial activation functions. We consider the general scenario where the running time is unlimited and ...

We conceptualize explainability in terms of logic and formula size, giving a number of related definitions of explainability in a very general setting. Our main interest is the so-called special explanation problem which ...

Transformers are the basis of modern large language models, but relatively little is known about their precise expressive power on graphs. We study the expressive power of graph transformers (GTs) by Dwivedi and Bresson ...

<p>We investigate repeated win-lose coordination games and analyse when and how rational players can guarantee eventual coordination in such games. Our study involves both the setting with a protocol shared in advance ...

We introduce a method for computing immediately human interpretable yet accurate classifiers from tabular data. The classifiers obtained are short Boolean formulas, computed via first discretizing the original data and ...