Related papers: An algorithm for composition of inverse problems w…
The paper presents a method for obtaining problems whose conclusions contain disjunctive propositions. These problems constitute a version of inverse problems with a given logical structure. The logical models in the groups of problems…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and…
These lecture notes highlight the mathematical and computational structure relating to the formulation of, and development of algorithms for, the Bayesian approach to inverse problems in differential equations. This approach is fundamental…
In this paper, we develop a numerical algorithm for an inverse problem on determining fractional orders of time derivatives simultaneously in a coupled subdiffusion system. Following the theoretical uniqueness, we reformulate the order…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…
This paper introduces and studies the sequential composition and decomposition of propositional logic programs. We show that acyclic programs can be decomposed into single-rule programs and provide a general decomposition result for…
The determination of Parton Distribution Functions from a finite set of data is a typical example of an inverse problem. Inverse problems are notoriously difficult to solve, in particular when a robust determination of the uncertainty in…
An integro-differential Dirac system with an integral term in the form of convolution is considered. We suppose that the convolution kernel is known a priori on a part of the interval, and recover it on the remaining part, using a part of…
In this paper we present an algorithm to find the discrete Lagrangian for an autonomous recurrence relation of arbitrary even order $2k$ with $k>1$. The method is based on the existence of a set of differential operators called annihilation…
In the inverse problem in particle physics, given an unexpected observation, one aims to identify a unique choice from amongst several competing hypotheses. We explore a novel approach of applying self-organizing maps to the inverse problem…
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…
We introduce an operator on problems in Weihrauch complexity, which we call the inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a…
An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and their intended…