Related papers: On tractability and congruence distributivity
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…
Dependency syntax represents the structure of a sentence as a tree composed of dependencies, i.e., directed relations between lexical units. While in its more general form any such tree is allowed, in practice many are not plausible or are…
Construction grammar posits that constructions, or form-meaning pairings, are acquired through experience with language (the distributional learning hypothesis). But how much information about constructions does this distribution actually…
A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive…
A leaf path language is a Boolean combination of sets of the form $\mathsf{{}^mE}^k L$, with $k \ge 1$ and $L$ a regular word language, which consist of those forests where the node labels in at least $k$ leaf-to-root paths make up a word…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
This paper presents a novel latent variable recurrent neural network architecture for jointly modeling sequences of words and (possibly latent) discourse relations between adjacent sentences. A recurrent neural network generates individual…
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…
Efforts to apply transformer-based language models (TLMs) to the problem of reasoning in natural language have enjoyed ever-increasing success in recent years. The most fundamental task in this area to which nearly all others can be reduced…
During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of…
Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them to tractable lineages. In our previous work, using…
A discrete duality is a relationship between classes of algebras and classes of relational systems (frames) resulting in two representation theorems building on the early work of J\'onsson and Tarski, Kripke, and van Benthem. In this…
Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of instances defined by excluding subproblems. This approach…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
Qualitative calculi play a central role in representing and reasoning about qualitative spatial and temporal knowledge. This paper studies distributive subalgebras of qualitative calculi, which are subalgebras in which (weak) composition…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
We consider a class of extensions of associative algebras, which we refer to as ``strongly proj-bounded extensions''. We prove that the finiteness of the left global dimension and the support of the Hochschild homology is preserved by…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
In this paper we study projective algebras in varieties of (bounded) commutative integral residuated lattices from an algebraic (as opposed to categorical) point of view. In particular we use a well-established construction in residuated…