Related papers: When Are Prime Formulae Characteristic?
If a higher derivative theory arises from a transformation of variables that involves time derivatives, a tailor-made Hamiltonian formulation is shown to exist. The details and advantages of this elegant Hamiltonian formulation, which…
This paper presents a transformational approach for model checking two important classes of metric temporal logic (MTL) properties, namely, bounded response and minimum separation, for nonhierarchical object-oriented Real-Time Maude…
The causal structure of Einstein's evolution equations is considered. We show that in general they can be written as a first order system of balance laws for any choice of slicing or shift. We also show how certain terms in the evolution…
Bayesian model comparison requires the specification of a prior distribution on the parameter space of each candidate model. In this connection two concerns arise: on the one hand the elicitation task rapidly becomes prohibitive as the…
Monoid actions of trace monoids over finite sets are powerful models of concurrent systems---for instance they encompass the class of 1-safe Petri nets. We characterise Markov measures attached to concurrent systems by finitely many…
By positing a relationship between naturalistic reading times and information-theoretic surprisal, surprisal theory (Hale, 2001; Levy, 2008) provides a natural interface between language models and psycholinguistic models. This paper…
In [1], the authors have studied stability of certain causal properties of space-times in general relativity. As a continuation of this work, in the present paper, we review and discuss, some more aspects of stability which occur in various…
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…
For the existence of strong duality in convex optimization regularity conditions play an indisputable role. We mainly deal in this paper with regularity conditions formulated by means of different generalizations of the notion of interior…
We consider the problem of mining signal temporal logical requirements from a dataset of regular (good) and anomalous (bad) trajectories of a dynamical system. We assume the training set to be labeled by human experts and that we have…
In this paper, we introduce the notion of pseudo-primary elements and pseudo-classical primary elements in an $L$-module $M$ and obtain their characterizations. The aim of the paper is to show $rad(N)\in M$, the radical of $N\in M$ is prime…
We present a lattice of distributed program specifications, whose ordering represents implementability/refinement. Specifications are modelled by families of subsets of relative execution traces, which encode the local orderings of state…
We extend the formal framework of classifier models used in the legal domain. While the existing classifier framework characterises cases solely through the facts involved, legal reasoning fundamentally relies on both facts and rules,…
Complex classifiers may exhibit "embarassing" failures in cases where humans can easily provide a justified classification. Avoiding such failures is obviously of key importance. In this work, we focus on one such setting, where a label is…
Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting…
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…
Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…
Let g be the Lie superalgebra p(3) of rank 2 over an algebraically closed field K of characteristic p > 3. We classify all irreducible modules of g, and give the character formulae for irreducible modules.
Research on the distribution of prime numbers has revealed a dual character: deterministic in definition yet exhibiting statistical behavior reminiscent of random processes. In this paper we show that it is possible to use an image-focused…
This is an intuitive introduction to classic sliding mode control that shows how the associated assumptions and condition for its use arise in the context of a derivation of the method. It derives a controller that obviates the need for the…