Sciweavers

886 search results - page 101 / 178
» Modal logic and invariance
Sort
View
CSL
2010
Springer
13 years 11 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 10 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
ATAL
2003
Springer
14 years 3 months ago
Distribution of goals addressed to a group of agents
The problem investigated in this paper is the distribution of goals addressed to a group of rational agents. Those agents are characterized by their ability (i.e. what they can do...
Laurence Cholvy, Christophe Garion
SLOGICA
2008
73views more  SLOGICA 2008»
13 years 10 months ago
Some Aspects of Polyadic Inductive Logic
We give a brief account of some de Finetti style representation theorems for probability functions satisfying Spectrum Exchangeability in Polyadic Inductive Logic, together with ap...
Jürgen Landes, Jeff B. Paris, Alena Vencovsk&...
JLP
2008
81views more  JLP 2008»
13 years 10 months ago
Cut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary ru...
Kai Brünnler, Martin Lange