Related papers: Decidability of Existence and Construction of a Co…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
We give necessary and sufficient conditions for the Chebyshev inequality to be an equality.
The concept of composability states that entropy of the total system composed of independent subsystems is a function of entropies of the subsystems. Here, the most general pseudoadditivity rule for composable entropy is derived based only…
Service composition has become commonplace nowadays, in large part due to the increased complexity of software and supporting networks. Composition can be of many types, for instance sequential, prioritising, non-deterministic. However, a…
Lexicographic composition is a natural way to build an aggregate choice function from component choice functions. As the name suggests, the components are ordered and choose sequentially. The sets that subsequent components select from are…
In this paper, we introduce semi-infinite tensor complementarity problem to provide an approach for considering a more realistic situation of the problem. We prove the necessary and sufficient conditions for the existence of the solution…
A (conjecturally complete) list of components of complements of discriminant varieties of parabolic singularities of smooth real functions is given. We also promote a combinatorial program that enumerates possible topological types of…
Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detection of partial assignments satisfying an input formula. In…
We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…
We present a non-vacuous definition of compositionality. It is based on the idea of combining the minimum description length principle with the original definition of compositionality (that is, that the meaning of the whole is a function of…
Argumentation is the process of constructing arguments about propositions, and the assignment of statements of confidence to those propositions based on the nature and relative strength of their supporting arguments. The process is modelled…
There is a lot of redundancy in the usual definition of adjoint functors. We define and prove the core of what is required. First we do this in the hom-enriched context. Then we do it in the cocompletion of a bicategory with respect to…
There are given conditions for represention of a function of many arguments as the difference of convex functions.
We define a canonical form for piecewise defined functions. We show that this has a wider range of application as well as better complexity properties than previous work.
We introduce and discuss the notion of naturally full functor. The definition is similar to the definition of separable functor: a naturally full functor is a functorial version of a full functor, while a separable functor is a functorial…
We study how to infer new choices from prior choices using the framework of choice functions, a unifying mathematical framework for decision-making based on sets of preference orders. In particular, we define the natural (most conservative)…
Three algorithms are presented that determine the existence of satisfying assignments for 3SAT Boolean satisfiability expressions. One algorithm is presented for determining an instance of a satisfying assignment, where such exists. The…
We derive axiomatically the probability function that should be used to make decisions given any form of underlying uncertainty.
Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the specification. Completeness means that the program produces…