A High-Level Policy Description Language for the Network ACL

Author(s):  
Jangha Kim ◽  
Kanghee Lee ◽  
Sangwook Kim ◽  
Jungtaek Seo ◽  
Eunyoung Lee ◽  
...  
2014 ◽  
Vol 49 ◽  
pp. 171-206 ◽  
Author(s):  
S. Schiffel ◽  
M. Thielscher

A general game player is a system that can play previously unknown games just by being given their rules. For this purpose, the Game Description Language (GDL) has been developed as a high-level knowledge representation formalism to communicate game rules to players. In this paper, we address a fundamental limitation of state-of-the-art methods and systems for General Game Playing, namely, their being confined to deterministic games with complete information about the game state. We develop a simple yet expressive extension of standard GDL that allows for formalising the rules of arbitrary finite, n-player games with randomness and incomplete state knowledge. In the second part of the paper, we address the intricate reasoning challenge for general game-playing systems that comes with the new description language. We develop a full embedding of extended GDL into the Situation Calculus augmented by Scherl and Levesque's knowledge fluent. We formally prove that this provides a sound and complete reasoning method for players' knowledge about game states as well as about the knowledge of the other players.


Author(s):  
ROBERT J. GAUTIER ◽  
HUW E. OLIVER ◽  
MARK RATCLIFFE ◽  
BENJAMIN R. WHITTLE

CDL is a language for describing reusable software components. It facilitates the reuse of software components by providing a high-level model for component interfaces and mechanisms for describing the relationships between them. CDL extends the parameterisation mechanisms of modern high-level languages and helps to avoid the difficulties that can be encountered in specifying and instantiating generic components. CDL does this without explicit parameterisation or inheritance operators, and thus frees the designer from having to predict the reusability potential of the component. In these respects, CDL supports reuse at two levels. Components may inherit, generically instantiate or import other components. Furthermore, a CDL schema provides a design description that can itself be reused.


Author(s):  
Yuki Watanabe ◽  
Naofumi Homma ◽  
Katsuhiko Degawa ◽  
Takafumi Aoki ◽  
Tatsuo Higuchi

2021 ◽  
Author(s):  
David Rajaratnam ◽  
Michael Thielscher

The standard representation formalism for multi-agent epistemic planning has one central disadvantage: When you use event models in dynamic epistemic logic (DEL) to describe the action of one agent, the model must specify not only the actual change and the change of that agent's knowledge. Also required is the epistemic change of any agents that may be observing the first agent performing the action, plus the epistemic change for any further agents that failed to observe that anything had taken place. To overcome the gap between this complex DEL notion of events and a more commonsense notion of actions, we propose a simple high-level action description language for multi-agent epistemic planning domains with just one type of effect laws: a causes x if y. Effect x can either be a physical effect, or an observation from an independent set that is specific to individual agents. We formally prove that any DEL event model can be described in this way. We show how this language provides a framework for expressing a variety of executability and action models; such as describing actions that are both ontic and epistemic, partially observable, or nondeterministic. We further combine our representation of event models with a description language for finitary initial epistemic theories, and we show how this allows us to reason about the effects of a sequence of actions in a multi-agent epistemic domain by updating a single multi-pointed epistemic model.


Sign in / Sign up

Export Citation Format

Share Document