Search Results

We study the problem of none-stable truth values for modal formulas. Our aim is to investigate temporal-modal logics for description reliability of information. We investigate a logic with rather standard relational models for branching time ...

This paper presents the results of an ontological analysis of collective entities, as an essential step towards the definition of a rich semantic model underlying ontology-driven applications in the historical and cultural heritage domains. The major ...

The notions of strong/weak approximations have been studied extensively in recent years. These approximations are based on a structure of the form (W,{R_i}_{i∈ N}), called the multiple-source approximation system, where R_i is an equivalence relation on W, ...

Context-aware systems are ubiquitous computing systems capable to adapt themselves to a dynamically changing environment. Ensuring consistency in context-aware systems has proved a challenging task due to the inherent expressive power required to model ...

The stochastic interpretation of Parikh's game logic should not follow the usual pattern of Kripke models, which in turn are based on the Kleisli morphisms for the Giry monad, rather, a specific and more general approach to probabilistic nondeterminism ...

The paper proposes an extension of the modal logic ${\cal AG}_n$ with operators for reasoning about different types of strategies which agents may adopt in order to win a dialogue game. We model agent communication using the paradigm of formal systems ...

Quantified μ-calculi combine the fix-point and modal operators of temporal logics with (existential and universal) quantifiers, and they allow for reasoning about the possible behaviour of individual components within a software system. In this paper we ...

This paper studies an interpretation of the Chance Discovery (CD) as the unification problem in the linear modal logic S4.3. We prove that any formula unifiable in S4.3 has a most general unifier, and we give an algorithm which, for any unifiable ...

The logics of knowledge are modal logics that have been shown to be effective in representing and reasoning about knowledge in multi-agent domains. Relatively few computational frameworks for dealing with computation of models and useful transformations ...

We specify the operational semantics and bisimulation relations for the finite φ-calculus within a logic that contains the ∇ quantifier for encoding generic judgments and definitions for encoding fixed points. Since we restrict to the finite case, the ...

We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select portions of documents subject to transformations. We explore how recent results ...

In this paper, labeled transition systems are proposed as a unifying approach to deal with the semantics of a multi-agent system. The presented model represents a multi-agent system by a triplet consisting of a set of states, a set of actions and a set ...

Process algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to support the use of process algebras to specify and analyze concurrent ...

A unified approach is developed for constructing first-order cut-free sequent calculi without equality representing two classes of modal logics in dependence of whether classical logic or intuitionistic one is taken as a basis. It uses the original ...

Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or computation sequences. Moreover, tailor-made interpreters display terms as two-...

We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the top-down evaluation algorithm, and the magic-set transformation ...

We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the top-down evaluation algorithm, and the magic-set transformation for ...

In this paper we prove that adding a confluence axiom to a modal logic which behaves rather well from the viewpoint of complexity of the satisfaction problem, drastically increases its complexity and blows it up from PSPACE-completeness to NEXPTIME-...

A general framework for network aware programming is presented that consists of a language for programming mobile applications, a logic for specifying properties of the applications and an automatic tool for verifying such properties. The framework is ...

Traditionally, security protocols have been designed and verified using informal techniques. However, the absence of formal verification can lead to security errors remaining undetected. Formal verification techniques, on the other hand, provide a ...