語用論(Pragmatics)を考える

An Introduction to MultiAgent Systems.

What is modal logic

Knowledge Representation, which lies at the core of Artificial Intelligence, is concerned with encoding knowledge on computers to enable systems to reason automatically. The Handbook of Knowledge Representation is an up-to-date review of twenty-five key topics in knowledge representation, written by the leaders of each field.This book is an essential resource for students, researchers and practitioners in all areas of Artificial Intelligence. * Make your computer smarter* Handle qualitative and uncertain information* Improve computational tractability to solve your problems easily

Handbook of Knowledge Representation

Alternating-time temporal logic

We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet Rather than changing the semantic structures, we generalize the usual interpretation of formulae in single states to sets of states We also propose a new epistemic operator for “practical” or “constructive” knowledge, and we show that the new logic (which we call Constructive Strategic Logic) is strictly more expressive than most existing solutions, while it retains the same model checking complexity Finally, we study properties of constructive knowledge and other operators in this non-standard semantics

/pdf/constructive-knowledge-what-agents-can-achieve-under-3gbe32y9ry.pdf

Constructive knowledge: what agents can achieve under imperfect information

In Alternating-time Temporal Logic (ATL), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal φ such as: "agent i can choose a strategy such that, if i follows this strategy then, no matter what other agents do, φ will always be true". However, strategies in ATL are revocable in the sense that in the evaluation of the goal φ the agent i is no longer restricted by the strategy she has chosen in order to reach the state where the goal is evaluated. In this paper we consider alternative variants of ATL where strategies, on the contrary, are irrevocable. The difference between revocable and irrevocable strategies shows up when we consider the ability to achieve a goal which, again, involves (nested) strategic ability. Furthermore, unlike in the standard semantics of ATL, memory plays an essential role in the semantics based on irrevocable strategies.

/pdf/alternating-time-temporal-logics-with-irrevocable-strategies-1qegtrdt08.pdf

Alternating-time temporal logics with irrevocable strategies

Group announcement logic

We introduce Normative Temporal Logic (NTL), a logic for reasoning about normative systems. NTL is a generalisation of the well-known branching-time temporal logic CTL, in which the path quantifiers A ("on all paths... ") and E ("on some path... ") are replaced by the indexed deontic operators Oη and Pη, where for example Oη φ means "φ is obligatory in the context of normative system η". After defining the logic, we give a sound and complete axiomatisation, and discuss the logic's relationship to standard deontic logics. We present a symbolic representation language for models and normative systems, and identify four different model checking problems, corresponding to whether or not a model is represented symbolically or explicitly, and whether or not we are given an interpretation for the normative systems named in formulae to be checked. We show that the complexity of model checking varies from P-complete up to EXPTIME-hard for these variations.

/pdf/on-the-logic-of-normative-systems-13vx8qj52h.pdf

On the logic of normative systems

We introduce emph{Normative Temporal Logic} (acro{ntl}), a logic for
reasoning about normative systems. acro{ntl} is a generalisation of
the well-known branching-time temporal logic acro{ctl}, in which the
path quantifiers $Apath$ (``on all pathsldots'') and $Epath$ (``on
some pathldots'') are replaced by the indexed deontic operators
$O{
s}$ and $P{
s}$, where for example $O{
s}phi$ means
``$phi$ is obligatory in the context of normative system $
s$''.
After defining the logic, we give a sound and complete axiomatisation,
and discuss the logic's relationship to standard deontic logics. We
present a symbolic representation language for models and normative
systems, and identify four different model checking problems,
corresponding to whether or not a model is represented symbolically or
explicitly, and whether or not we are given an interpretation for the
normative systems named in formulae to be checked. We show that the
complexity of model checking varies from acro{p}-complete up to
acro{exptime}-hard for these variations.

https://drops.dagstuhl.de/opus/volltexte/2007/921/pdf/07122.AgotnesThomas.Paper.921.pdf/

Thomas Ågotnes

Papers

Constructive knowledge: what agents can achieve under imperfect information

Alternating-time temporal logics with irrevocable strategies

Group announcement logic

On the logic of normative systems

On the Logic of Normative Systems