The circuit complexity class DLOGTIME-uniform AC^0 is known to be a mode...
We study the expressivity and the complexity of various logics in
probab...
We study the complexity of the problem of training neural networks defin...
We introduce and develop a set-based semantics for asynchronous TeamLTL....
Semiring semantics for first-order logic provides a way to trace how fac...
In this article, we study the complexity of weighted team definability f...
We study the complexity of reasoning tasks for logics in team semantics....
In this article we study linear temporal logics with team semantics (Tea...
In this paper, we investigate the parameterized complexity of model chec...
We define and study logics in the framework of probabilistic team semant...
Infamously, the finite and unrestricted implication problems for the cla...
We study the expressivity and the model checking problem of linear tempo...
Second-order Boolean logic is a generalization of QBF, whose constant
al...
We introduce a novel variant of BSS machines called Separate Branching B...
We study descriptive complexity of counting complexity classes in the ra...
We study probabilistic team semantics which is a semantical framework
al...
Team semantics is a semantical framework for the study of dependence and...
We present a complete finite axiomatization of the unrestricted implicat...