7,321 research outputs found
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction,
compositional modelling, employs a set of models of particular functional
components. Its inference mechanism takes a scenario describing the constituent
interacting components of a system and translates it into a useful mathematical
model. This paper presents a novel compositional modelling approach aimed at
building model repositories. It furthers the field in two respects. Firstly, it
expands the application domain of compositional modelling to systems that can
not be easily described in terms of interacting functional components, such as
ecological systems. Secondly, it enables the incorporation of user preferences
into the model selection process. These features are achieved by casting the
compositional modelling problem as an activity-based dynamic preference
constraint satisfaction problem, where the dynamic constraints describe the
restrictions imposed over the composition of partial models and the preferences
correspond to those of the user of the automated modeller. In addition, the
preference levels are represented through the use of symbolic values that
differ in orders of magnitude
Structural operational semantics for stochastic and weighted transition systems
We introduce weighted GSOS, a general syntactic framework to specify well-behaved transition systems where transitions are equipped with weights coming from a commutative monoid. We prove that weighted bisimilarity is a congruence on systems defined by weighted GSOS specifications. We illustrate the flexibility of the framework by instantiating it to handle some special cases, most notably that of stochastic transition systems. Through examples we provide weighted-GSOS definitions for common stochastic operators in the literature
Lexical and Derivational Meaning in Vector-Based Models of Relativisation
Sadrzadeh et al (2013) present a compositional distributional analysis of
relative clauses in English in terms of the Frobenius algebraic structure of
finite dimensional vector spaces. The analysis relies on distinct type
assignments and lexical recipes for subject vs object relativisation. The
situation for Dutch is different: because of the verb final nature of Dutch,
relative clauses are ambiguous between a subject vs object relativisation
reading. Using an extended version of Lambek calculus, we present a
compositional distributional framework that accounts for this derivational
ambiguity, and that allows us to give a single meaning recipe for the relative
pronoun reconciling the Frobenius semantics with the demands of Dutch
derivational syntax.Comment: 10 page version to appear in Proceedings Amsterdam Colloquium,
updated with appendi
Iterated reflection principles over full disquotational truth
Iterated reflection principles have been employed extensively to unfold
epistemic commitments that are incurred by accepting a mathematical theory.
Recently this has been applied to theories of truth. The idea is to start with
a collection of Tarski-biconditionals and arrive by finitely iterated
reflection at strong compositional truth theories. In the context of classical
logic it is incoherent to adopt an initial truth theory in which A and 'A is
true' are inter-derivable. In this article we show how in the context of a
weaker logic, which we call Basic De Morgan Logic, we can coherently start with
such a fully disquotational truth theory and arrive at a strong compositional
truth theory by applying a natural uniform reflection principle a finite number
of times
Deductive and Analogical Reasoning on a Semantically Embedded Knowledge Graph
Representing knowledge as high-dimensional vectors in a continuous semantic
vector space can help overcome the brittleness and incompleteness of
traditional knowledge bases. We present a method for performing deductive
reasoning directly in such a vector space, combining analogy, association, and
deduction in a straightforward way at each step in a chain of reasoning,
drawing on knowledge from diverse sources and ontologies.Comment: AGI 201
Probabilistic Rely-guarantee Calculus
Jones' rely-guarantee calculus for shared variable concurrency is extended to
include probabilistic behaviours. We use an algebraic approach which combines
and adapts probabilistic Kleene algebras with concurrent Kleene algebra.
Soundness of the algebra is shown relative to a general probabilistic event
structure semantics. The main contribution of this paper is a collection of
rely-guarantee rules built on top of that semantics. In particular, we show how
to obtain bounds on probabilities by deriving rely-guarantee rules within the
true-concurrent denotational semantics. The use of these rules is illustrated
by a detailed verification of a simple probabilistic concurrent program: a
faulty Eratosthenes sieve.Comment: Preprint submitted to TCS-QAP
- ā¦