Results 1  10
of
567,321
Epistemic Learning Programs A Calculus for Describing Epistemic Action Models
"... Dynamic Epistemic Logic makes it possible to model and reason about information change in multiagent systems. Information change is mathematically modeled through epistemic action Kripke models introduced by Baltag et al. Also, van Ditmarsch interprets the information change as a relation between ..."
Abstract
 Add to MetaCart
, privately, concurrently or even wrongly. Hence moving along this path, we introduce the notion of a learning program and prove that all finite K45 action models can be described by our learning programs. 1
On Distinguishing Epistemic from Pragmatic Action
 Cognitive Science
, 1994
"... We present data and argument to show that in Tetrisa realtime, interactive video gamecertain cognitive and perceptual problems ore more quicktv, easily, and reliably solved by performing actions in the world than by performing computational actions in the head atone. We have found that some of t ..."
Abstract

Cited by 334 (10 self)
 Add to MetaCart
pragmatic octionsactions performed to bring one physically closer to a goalfrom epistemic actionsactions performed to uncover informatioan that is hidden or hard to compute mentally. To illustrate the need for epistemic actions, we first develop a standard informationprocessing model of Tetris
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
the applicability of theoretical results to real situations. In this paper we introduce a new calculus based on a categorical semantics for computations. This calculus provides a correct basis for proving equivalence of programs, independent from any specific computational model. 1 Introduction This paper
Algebra and Sequent Calculus for Epistemic Actions
 ENTCS PROCEEDINGS OF LOGIC AND COMMUNICATION IN MULTIAGENT SYSTEMS (LCMAS) WORKSHOP, ESSLLI 2004
, 2005
"... We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic arise, (ii) it goes with the introduction of nondeterminis ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
constitute a quantale. We also introduce a corresponding sequent calculus (which extends Lambek calculus), in which propositions, actions as well as agents appear as resources in a resourcesensitive dynamicepistemic logic.
Concurrent Dynamic Epistemic Logic
, 2003
"... When giving an nalysis of knowledge in multiagent systems, one needs a framework in which higherorder information and its dynamics can both be represented. A recent tradition stoxting in origina work by Plaza treats all of knowledge, higherorder knowledge, and its dynamics on the sae foot. Our ..."
Abstract

Cited by 181 (31 self)
 Add to MetaCart
higherorder information. We demonstrate that such information changes require subtle descriptions. Our contribution is to provide a complete axiomatization for n action language of vn Ditmoxsch, where an action is interpreted as a relation between epistemic states (pointed models) and sets
Epistemic actions as resources
 Journal of Logic and Computation
, 2007
"... We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. deceit. We give a purely algebraic treatment of the muddy children puzzle, ..."
Abstract

Cited by 22 (17 self)
 Add to MetaCart
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. deceit. We give a purely algebraic treatment of the muddy children puzzle
GOLOG: A Logic Programming Language for Dynamic Domains
, 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract

Cited by 621 (72 self)
 Add to MetaCart
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world
Genetic Programming
, 1997
"... Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring ..."
Abstract

Cited by 1051 (12 self)
 Add to MetaCart
Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring
Coupled hidden Markov models for complex action recognition
, 1996
"... We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying twohanded actions. HMMs are perhaps the most successful framework in perceptual computing for modeling and ..."
Abstract

Cited by 497 (22 self)
 Add to MetaCart
We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying twohanded actions. HMMs are perhaps the most successful framework in perceptual computing for modeling
Results 1  10
of
567,321