Results 1  10
of
19
The Logic of Games and its Applications
 Annals of Discrete Mathematics
, 1985
"... We develop a Logic in which the basic objects of concern are games, or equivalently, monotone predicate transforms. We give completeness and decision results and extend to certain kinds of manyperson games. Applications to a cake cutting algorithm and to a protocol for exchanging secrets, are given ..."
Abstract

Cited by 63 (5 self)
 Add to MetaCart
We develop a Logic in which the basic objects of concern are games, or equivalently, monotone predicate transforms. We give completeness and decision results and extend to certain kinds of manyperson games. Applications to a cake cutting algorithm and to a protocol for exchanging secrets, are given. 1
A Complete Deductive System for the µCalculus
, 1995
"... The propositional µcalculus as introduced by Kozen in [12] is considered. In that paper ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
The propositional µcalculus as introduced by Kozen in [12] is considered. In that paper
Reducing dynamic epistemic logic to PDL by program transformation. SENE0423
 In [vE005
, 2004
"... We present a direct reduction of dynamic epistemic logic in the spirit of [4] to propositional dynamic logic (PDL) [17, 18] by program transformation. The program transformation approach associates with every update action a transformation on PDL programs. These transformations are then employed in ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
We present a direct reduction of dynamic epistemic logic in the spirit of [4] to propositional dynamic logic (PDL) [17, 18] by program transformation. The program transformation approach associates with every update action a transformation on PDL programs. These transformations are then employed in reduction axioms for the update actions. It follows that the logic of public announcement, the logic of group announcements, the logic of secret message passing, and so on, can all be viewed as subsystems of PDL. Moreover, the program transformation approach can be used to generate the appropriate reduction axioms for these logics. Our direct reduction of dynamic epistemic logic to PDL was inspired by the reduction of dynamic epistemic logic to automata PDL of [13]. Our approach shows how the detour through automata can be avoided.
The gamut of dynamic logic
 Handbook of the History of Logic, Volume 6 – Logic and the Modalities in the Twentieth Century
, 2006
"... Dynamic logic, broadly conceived, is the logic that analyses change by decomposing actions into their basic building blocks and by describing the results of performing actions in given states of the world. The actions studied by dynamic logic can be of various kinds: actions on the memory state of a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Dynamic logic, broadly conceived, is the logic that analyses change by decomposing actions into their basic building blocks and by describing the results of performing actions in given states of the world. The actions studied by dynamic logic can be of various kinds: actions on the memory state of a computer, actions of a moving robot in a closed world, interactions between cognitive agents performing given communication protocols, actions that change the common ground between speaker and hearer in a conversation, actions that change the contextually available referents in a conversation, and so on. In each of these application areas, dynamic logics can be used to model the states involved and the transitions that occur between them. Dynamic logic is a tool for both state description and action description. Formulae describe states, while actions or programs express state change. The levels of state descriptions and transition characterisations are connected by suitable operations that allow reasoning about pre and postconditions of particular changes.
Guarded actions
 Interactive Logic, Texts in Logic and Games
"... Guarded actions are changes with preconditions acting as a guard. Guarded action models are multimodal Kripke models with the valuations replaced by guarded actions. Call guarded action logic the result of adding product updates with guarded action models to PDL (propositional dynamic logic). We sho ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Guarded actions are changes with preconditions acting as a guard. Guarded action models are multimodal Kripke models with the valuations replaced by guarded actions. Call guarded action logic the result of adding product updates with guarded action models to PDL (propositional dynamic logic). We show that guarded action logic reduces to PDL.
Logics of Dynamical Systems
"... We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the state of a system evolves over time. They are important in modeling and understanding many applications, including embedded ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the state of a system evolves over time. They are important in modeling and understanding many applications, including embedded systems and cyberphysical systems. In discrete dynamical systems, the state evolves in discrete steps, one step at a time, as described by a difference equation or discrete state transition relation. In continuous dynamical systems, the state evolves continuously along a function, typically described by a differential equation. Hybrid dynamical systems or hybrid systems combine both discrete and continuous dynamics. Distributed hybrid systems combine distributed systems with hybrid systems, i.e., they are multiagent hybrid systems that interact through remote communication or physical interaction. Stochastic hybrid systems combine stochastic
Reasoning About Games
 Studia Logica
"... A mixture of propositional dynamic logic and epistemic logic is used to give a formalization of Artemov’s knowledge based reasoning approach to game theory, (KBR), [4, 5, 6, 7]. We call the (family of) logics used here PDL + E. It is in the general family of Dynamic Epistemic Logics [21], was applie ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A mixture of propositional dynamic logic and epistemic logic is used to give a formalization of Artemov’s knowledge based reasoning approach to game theory, (KBR), [4, 5, 6, 7]. We call the (family of) logics used here PDL + E. It is in the general family of Dynamic Epistemic Logics [21], was applied to games already in [20], and investigated further in [18, 19]. Epistemic states of players, usually treated informally in gametheoretic arguments, are here represented explicitly and reasoned about formally. The heart of the presentation is a detailed analysis of the Centipede game using both the proof theoretic and the semantic machinery of PDL + E. The present work can be seen partly as an argument for the thesis that PDL + E should be the basis of the logical investigation of game theory. 1
Quantificational modal logic with sequential kripke semantics
 Journal of Applied NonClassical Logics
, 2005
"... ABSTRACT. We introduce quantificational modal operators as dynamic modalities with (extensions of) Henkin quantifiers as indices. The adoption of matrices of indices (with action identifiers, variables and/or quantified variables as entries) gives an expressive formalism which is here motivated with ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
ABSTRACT. We introduce quantificational modal operators as dynamic modalities with (extensions of) Henkin quantifiers as indices. The adoption of matrices of indices (with action identifiers, variables and/or quantified variables as entries) gives an expressive formalism which is here motivated with examples from the area of multiagent systems. We study the formal properties of the resulting logic which, formally speaking, does not satisfy the normality condition. However, the logic admits a semantics in terms of (an extension of) Kripke structures. As a consequence, standard techniques for normal modal logic become available. We apply these to prove completeness and decidability, and to extend some standard frame results to this logic.
Theorem proving and programming with dynamic first order logic
, 2000
"... Dynamic First Order Logic results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus for DF ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Dynamic First Order Logic results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus for DFOL with explicit (simultaneous) substitution, prove its soundness and completeness, and point out its relevance for programming with dynamic first order logic, and for automatic program analysis.
Converse, Local Determinism, and Graded Nondeterminism in Propositional Dynamic Logics
, 1994
"... Recent work on Knowledge Representation has brought new interest to Propositional Dynamic Logics (PDL's) by pointing out a tight correspondence between these logics and logics for representing structured knowledge (Description Logics, Terminological Languages). Nevertheless, this work has also made ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Recent work on Knowledge Representation has brought new interest to Propositional Dynamic Logics (PDL's) by pointing out a tight correspondence between these logics and logics for representing structured knowledge (Description Logics, Terminological Languages). Nevertheless, this work has also made apparent the lack in the known PDL's of certain constructs needed to fully exploit the correspondence. These are constructs to locally (wrt single states) constrain the running of an atomic program or its converse (the running of the atomic program backward) to be deterministic, or to have a specified amount of nondeterminism only. In fact, we believe that PDL's can take advantage of this kind of constructs to model many interesting properties of actual computations. In this paper, we extend Converse PDL, first by including a construct for local determinism of simple programs (either an atomic program or the converse of an atomic program), and then by including constructs for graded nondeter...