9,710 research outputs found
Distances between States and between Predicates
This paper gives a systematic account of various metrics on probability
distributions (states) and on predicates. These metrics are described in a
uniform manner using the validity relation between states and predicates. The
standard adjunction between convex sets (of states) and effect modules (of
predicates) is restricted to convex complete metric spaces and directed
complete effect modules. This adjunction is used in two state-and-effect
triangles, for classical (discrete) probability and for quantum probability
Expressive Logics for Coinductive Predicates
The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, moving from transition systems to coalgebras and from bisimilarity to coinductive predicates. We formulate when a logic fully characterises a coinductive predicate on coalgebras, by providing suitable notions of adequacy and expressivity, and give sufficient conditions on the semantics. The approach is illustrated with logics characterising similarity, divergence and a behavioural metric on automata
FURY: Fuzzy unification and resolution based on edit distance
We present a theoretically founded framework for fuzzy
unification and resolution based on edit distance over trees.
Our framework extends classical unification and resolution
conservatively. We prove important properties of the framework
and develop the FURY system, which implements the
framework efficiently using dynamic programming. We
evaluate the framework and system on a large problem in
the bioinformatics domain, that of detecting typographical
errors in an enzyme name databas
- ā¦