Related papers: Layer Systems for Proving Confluence

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

Social scientists have long appreciated that relationships between individuals cannot be described from observing a single domain, and that the structure across domains of interaction can have important effects on outcomes of interest…

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

We prove a general representation stability result for polynomial coefficient systems which lets us prove representation stability and secondary homological stability for many families of groups with polynomial coefficients. This gives two…

Higher-order constructs extend the expressiveness of first-order (Constraint) Logic Programming ((C)LP) both syntactically and semantically. At the same time assertions have been in use for some time in (C)LP systems helping programmers…

We prove a result of cohomology and base change for families of coherent systems over a curve. We use that in order to prove the existence of (non-split, non-degenerate) universal families of extensions for families of coherent systems (in…

In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent systems with an arbitrary number of…

A Lie system is a system of first-order differential equations admitting a superposition rule, i.e., a map that expresses its general solution in terms of a generic family of particular solutions and certain constants. In this work, we use…

We explore how different proof orderings induce different notions of saturation. We relate completion, paramodulation, saturation, redundancy elimination, and rewrite system reduction to proof orderings.

We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we develop two general approaches for an important…

Although neural module networks have an architectural bias towards compositionality, they require gold standard layouts to generalize systematically in practice. When instead learning layouts and modules jointly, compositionality does not…

We propose a general framework for inconsistency-tolerant query answering within existential rule setting. This framework unifies the main semantics proposed by the state of art and introduces new ones based on cardinality and majority…

This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each…

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

Modeling the structure of coherent texts is a key NLP problem. The task of coherently organizing a given set of sentences has been commonly used to build and evaluate models that understand such structure. We propose an end-to-end…

A notion of heaps of modules as an affine version of modules over a ring or, more generally, over a truss, is introduced and studied. Basic properties of heaps of modules are derived. Examples arising from geometry (connections, affine…

The theory of persistence modules on the commutative ladders $CL_n(\tau)$ provides an extension of persistent homology. However, an efficient algorithm to compute the generalized persistence diagrams is still lacking. In this work, we view…

Persistence is an important characteristic of many complex systems in nature, related to how long the system remains at a certain state before changing to a different one. The study of complex systems' persistence involves different…

We study hyperbolic systems of one-dimensional partial differential equations under general, possibly non-local boundary conditions. A large class of evolution equations, either on individual 1-dimensional intervals or on general networks,…

The Collatz Conjecture's connection to dynamical systems opens it to a variety of techniques aimed at recurrence and density results. First, we turn to density results and strengthen the result of Terras through finding a strict rate of…