Related papers: Incoherent coherences
We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…
It has recently been shown that generalized connections of the (A)dS space symmetry algebra provide an effective geometric and algebraic framework for all types of gauge fields in (A)dS, both for massless and partially-massless. The…
We generalise the notion of coherent states to arbitrary Lie algebras by making an analogy with the GNS construction in $C^*$-algebras. The method is illustrated with examples of semisimple and non-semisimple finite dimensional Lie algebras…
We prove the existence of a sequence of commutative diagrams generalizing existing results on the cohomology of the Borel-Serre boundary and well-rounded retract to the context of the well-tempered complex. Our main theorem provides a…
We introduce a generic seq2seq parsing framework that casts constituency parsing problems (syntactic and discourse parsing) into a series of conditional splitting decisions. Our parsing model estimates the conditional probability…
Among the most general structures extending the framework by Dung are the abstract dialectical frameworks (ADFs). They come equipped with various types of semantics, with the most prominent - the labeling-based one - analyzed in the context…
We provide a suitable axiomatic framework for differential cohomology in the relative case and we deduce the corresponding long exact sequences. We also construct the relative version of the generalized Cheeger-Simons characters and we…
Commutativity of program code (i.e. the equivalence of two code fragments composed in alternate orders) is of ongoing interest in many settings such as program verification, scalable concurrency, and security analysis. While some have…
In the realm of invertible symmetry, the topological approach based on classifying spaces dominates the classification of 't Hooft anomalies and symmetry protected topological phases. We explore the alternative algebraic approach based on…
We adapt the technique of type-generic programming via descriptions pointing into a universe to the domain of typed languages with binders and variables, implementing a notion of "syntax-generic programming" in a dependently typed…
We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as…
Particularly in the structure of global discourse, coherence plays a pivotal role in human text comprehension and is a hallmark of high-quality text. This is especially true for persuasive texts, where coherent argument structures support…
The study of register in computational language research has historically been divided into register analysis, seeking to determine the registerial character of a text or corpus, and register synthesis, seeking to generate a text in a…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
There is a large amount of literature on the topic of covarieties, coequations and coequational specifications, dating back to the early seventies. Nevertheless, coequations have not (yet) emerged as an everyday practical specification…
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent…
We introduce a formal operational semantics that describes the fused execution of variable contraction problems, which compute indexed arithmetic over a semiring and generalize sparse and dense tensor algebra, relational algebra, and graph…
In the recent years a lot of attention is focused on unconventional string compactifications. A variety of different but related frameworks was developed in order to address issues such as duality invariance, non-geometry and…
The original idea of proof nets can be formulated by means of interaction nets syntax. Additional machinery as switching, jumps and graph connectivity is needed in order to ensure correspondence between a proof structure and a correct proof…