47,211 research outputs found
Complexity Issues in Justification Logic
Justification Logic is an emerging field that studies provability, knowledge, and belief via explicit proofs or justifications that are part of the language. There exist many justification logics closely related to modal epistemic logics of knowledge and belief. Instead of modality â–¡ in pure justification logics, or in addition to modality â–¡ in hybrid logics, which has an existential epistemic reading \u27there exists a proof of F,\u27 all justification logics use constructs t:F, where a justification term t represents a blueprint of a Hilbert-style proof of F. The first justification logic, LP, introduced by Sergei Artemov, was shown to be a justification counterpart of modal logic S4 and serves as a missing link between S4 and Peano arithmetic, thereby solving a long-standing problem of provability semantics for S4 and Int.
The machinery of explicit justifications can be used to analyze well-known epistemic paradoxes, e.g. Gettier\u27s examples of justified true belief that can hardly be considered knowledge, and to find new approaches to the concept of common knowledge. Yet another possible application is the Logical Omniscience Problem, which reflects an undesirable property of knowledge as described by modality when an agent knows all the logical consequences of his/her knowledge. The language of justification logic opens new ways to tackle this problem.
This thesis focuses on quantitative analysis of justification logics. We explore their decidability and complexity of Validity Problem for them. A closer analysis of the realization phenomenon in general and of one procedure in particular enables us to deduce interesting corollaries about self-referentiality for several modal logics. A framework for proving decidability of various justification logics is developed by generalizing the Finite Model Property. Limitations of the method are demonstrated through an example of an undecidable justification logic. We study reflected fragments of justification logics and provide them with an axiomatization and a decision procedure whose complexity (the upper bound) turns out to be uniform for all justification logics, both pure and hybrid. For many justification logics, we also present lower and upper complexity bounds
Quantitative Hennessy-Milner Theorems via Notions of Density
The classical Hennessy-Milner theorem is an important tool in the analysis of concurrent processes;
it guarantees that any two non-bisimilar states in finitely branching labelled transition systems can
be distinguished by a modal formula. Numerous variants of this theorem have since been established
for a wide range of logics and system types, including quantitative versions where lower bounds on
behavioural distance (e.g. in weighted, metric, or probabilistic transition systems) are witnessed
by quantitative modal formulas. Both the qualitative and the quantitative versions have been
accommodated within the framework of coalgebraic logic, with distances taking values in quantales,
subject to certain restrictions, such as being so-called value quantales. While previous quantitative
coalgebraic Hennessy-Milner theorems apply only to liftings of set functors to (pseudo)metric spaces,
in the present work we provide a quantitative coalgebraic Hennessy-Milner theorem that applies more
widely to functors native to metric spaces; notably, we thus cover, for the first time, the well-known
Hennessy-Milner theorem for continuous probabilistic transition systems, where transitions are given
by Borel measures on metric spaces, as an instance of such a general result. In the process, we also
relax the restrictions imposed on the quantale, and additionally parametrize the technical account
over notions of closure and, hence, density, providing associated variants of the Stone-Weierstraß
theorem; this allows us to cover, for instance, behavioural ultrametrics.publishe
Lukasiewicz mu-Calculus
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour of a state in such a coalgebra. By moving away from a boolean universe of truth values, our approach can measure the extent to which a state in a system with branching is able to exhibit a particular linear-time behaviour. This instantiates to measuring the probability of a specific behaviour occurring in a probabilistic system, or measuring the minimal cost of exhibiting a specific behaviour in the case of weighted computations
Labelled transition systems as a Stone space
A fully abstract and universal domain model for modal transition systems and
refinement is shown to be a maximal-points space model for the bisimulation
quotient of labelled transition systems over a finite set of events. In this
domain model we prove that this quotient is a Stone space whose compact,
zero-dimensional, and ultra-metrizable Hausdorff topology measures the degree
of bisimilarity such that image-finite labelled transition systems are dense.
Using this compactness we show that the set of labelled transition systems that
refine a modal transition system, its ''set of implementations'', is compact
and derive a compactness theorem for Hennessy-Milner logic on such
implementation sets. These results extend to systems that also have partially
specified state propositions, unify existing denotational, operational, and
metric semantics on partial processes, render robust consistency measures for
modal transition systems, and yield an abstract interpretation of compact sets
of labelled transition systems as Scott-closed sets of modal transition
systems.Comment: Changes since v2: Metadata updat
Modal logics are coalgebraic
Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specific logics used in particular domains. The coalgebraic approach is generic and compositional: tools and techniques simultaneously apply to a large class of application areas and can moreover be combined in a modular way. In particular, this facilitates a pick-and-choose approach to domain specific formalisms, applicable across the entire scope of application areas, leading to generic software tools that are easier to design, to implement, and to maintain. This paper substantiates the authors' firm belief that the systematic exploitation of the coalgebraic nature of modal logic will not only have impact on the field of modal logic itself but also lead to significant progress in a number of areas within computer science, such as knowledge representation and concurrency/mobility
- …