Related papers: Nominal Unification Revisited
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
It is generally well agreed that developing a unifying theory is one of the most important issues in Data Mining research. In the last two decades, a great deal of work has been devoted to the algorithmic aspects of the Frequent Itemset…
We introduce and study the arithmetic function E_m(n), defined as the sum of the remainders of n when divided by the first m positive integers. Although the definition is elementary, the function encodes rich arithmetic structure. In this…
The paper mostly collects material on generic rank of $A$--modules with respect to differential geometric applications. Our research was motivated by geometry of $A$--structures. In particular, we discuss the case where $A$ is an unitary…
This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…
This paper presents a novel SHOI tableau calculus which incorporates algebraic reasoning for deciding ontology consistency. Numerical restrictions imposed by nominals, existential and universal restrictions are encoded into a set of linear…
In this paper we introduce a new approach for organizing algebras of global dimension at most 2. We introduce the notion of cluster equivalence for these algebras, based on whether their generalized cluster categories are equivalent. We are…
The denominator of the Hilbert series of a finitely generated R-module M does not always divide the denominator of the Hilbert series of R. For this reason, we define the universal denominator. The universal denominator of a module M is the…
The $\lambda$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enumeration and the functional…
We introduce a family of modules, called Markoff modules, generated by a cluster-mutation-like iterative process. We show that these modules are combinatorially similar to Christoffel words. Furthermore, we construct a bijective map between…
Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
Dual numbers and their higher order version are important tools for numerical computations, and in particular for finite difference calculus. Based upon the relevant algebraic rules and matrix realizations of dual numbers, we will present a…
Proof terms are syntactic expressions that represent computations in term rewriting. They were introduced by Meseguer and exploited by van Oostrom and de Vrijer to study equivalence of reductions in (left-linear) first-order term rewriting…
We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse…
We study the unitarity and modularity of ribbon tensor categories derived from simple affine Lie algebras, via their associated quantum groups. Based on numerical calculations, and assuming two conjectures, we provide the complete picture…
Unification and generalization are operations on two terms computing respectively their greatest lower bound and least upper bound when the terms are quasi-ordered by subsumption up to variable renaming (i.e., $t_1\preceq t_2$ iff $t_1 =…
Superposition rules form a class of functions that describe general solutions of systems of first-order ordinary differential equations in terms of generic families of particular solutions and certain constants. In this work we extend this…