Related papers: Comparing Weakest Precondition and Weakest Liberal…
In recent research on non-monotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P union R and Q union R have the same answer sets for any other program R. This…
Every definite logic program has as its meaning a least Herbrand model with respect to the program-independent ordering "set-inclusion". In the case of normal logic programs there do not exist least models in general. However, according to…
This paper presents some theoretical results relating the Bregman log determinant matrix divergence to Kaporin's condition number. These can be viewed as nearness measures between a preconditioner and a given matrix, and we show under which…
Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the…
In a unidimensional factor model it is assumed that the set of indicators that loads on this factor are conditionally independent given the latent factor. Two indicators are, however, never conditionally independent given (a set of) other…
Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks…
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…
The Necessary Maximality Principle for c.c.c. forcing asserts that any statement about a real in a c.c.c. extension that could become true in a further c.c.c. extension and remain true in all subsequent c.c.c. extensions, is already true in…
The aim of this paper is to introduce an algebraic structure on the set of all coalgebras with the same state space over the given type which allows us to present definitions of weak and delay bisimulation for coalgebras. Additionally, we…
We examine a property of sequences called Poissonian pair correlations with parameter $0\leqslant \beta \leqslant 1$ (abbreviated as $\beta$-PPC). We prove that when $\beta<1,$ the property of $\beta$-PPC, also known as weak Poissonian…
For a completely distributive quantale $L$, $L$-fuzzy strongest postcondition predicate transformers are introduced, and it is shown that, under reasonable assumptions, they are linear or affine continuous mappings between continuous…
This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…
The purpose of this paper is to prove a weak convergence result for empirical processes indexed in general classes of functions and with an underlying $\alpha$-mixing sequence of random variables. In particular the uniformly boundedness…
We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…
Classical confidence limits are compared to Bayesian error bounds by studying relevant examples. The performance of the two methods is investigated relative to the properties coherence, precision, bias, universality, simplicity. A proposal…
We present a novel, type-logical analysis of_polarity sensitivity_: how negative polarity items (like "any" and "ever") or positive ones (like "some") are licensed or prohibited. It takes not just scopal relations but also linear order into…
This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type "if ... then ...",…
One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…
We provide an interpretation of entanglement based on classical correlations between measurement outcomes of complementary properties: states that have correlations beyond a certain threshold are entangled. The reverse is not true, however.…
In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…