KR 2018 tutorial: Knowledge, Strategy, and Know-How (T4)

Welcome to the page of this tutorial that will be held on Sunday October 28 (afternoon), prior to the main technical program of KR 2018, which will run from 30 October to 1 November 2018. The attendance of tutorials is complimentary to all KR registered participants.


Brief description of the tutorial

An agent \(a\) comes to a fork in a road. There is a sign that says that one of the two roads leads to prosperity, another to death. The agent must take the fork, but she does not know which road leads where. Does the agent have a strategy to get to prosperity? On one hand, since one of the roads leads to prosperity, such a strategy clearly exists. We denote this fact by modal formula \({\sf S}_a p\), where statement \(p\) is a claim of future prosperity. Furthermore, agent \(a\) knows that such a strategy exists. We write this as \({\sf K}_a{\sf S}_a p\). Yet, the agent does not know what the strategy is and, thus, does not know how to use the strategy. We denote this by \(\neg{\sf H}_a p\), where know-how modality \({\sf H}_a\) expresses the fact that agent \(a\) knows how to achieve the goal \(p\) based on the information available to her.

In this tutorial we will explore the interplay between modality \({\sf K}\), representing knowledge, modality \({\sf S}\), representing the existence of a strategy, and modality \({\sf H}\), representing the existence of a know-how strategy (sometimes also called uniform strategy). Modalities \({\sf K}\), \({\sf H}\), and \({\sf S}\) can be considered for a single agent \(a\) or for a coalition of agents.


Outline of the tutorial

The tutorial is composed by the following six parts:

  • Single agent and distributed versions of epistemic modal logic;
  • Know-how as a linear plan;
  • Know-how as a uniform strategy on equivalence classes;
  • Interplay between know-how and knowledge modalities;
  • Marc Pauly logic of coalition power;
  • Interplay between coalition power and distributed knowledge.

Tutorial slides: 2018-KR-Tutorial


Target audience and prerequisite knowledge

Graduate students and researchers in knowledge representation and reasoning area interested in interaction between knowledge and action. The tutorial will assume familiarity with basic concepts from modal logic.


Brief biographies of the presenters

  • Pavel Naumov is a logician with research interests in theoretical foundations of artificial intelligence. He has published over sixty papers on reasoning about knowledge, strategies, costs, privacy, information flow, product diffusion, and rational behavior in multi-agent systems, as well as on proof complexity, automated deduction, type theory, and modal logics. Naumov has an undergraduate degree in Mathematics from Moscow State University and a doctoral degree in Computer Science from Cornell University. He is currently a Visiting Associate Professor at Claremont McKenna College.
  • Jia Tao is an assistant professor of computer science at Lafayette College. She completed her baccalaureate degree in Computer Science and Engineering at Zhejiang University in China and earned her Ph.D in Computer Science at Iowa State University. She has done research in the areas of multilevel security databases, semantics for Object-Oriented programming languages, game theory and artificial intelligence.  For the past several years, her research has focused on Knowledge Representation and Reasoning. She is especially interested in designing logical systems that express and reason about certain social phenomena related to knowledge and information.

Contact

If you have any questions about the tutorial, do not hesitate to contact us:

  • Pavel Naumov: pgn2@cornell.edu
  • Jia Tao: taoj@lafayette.edu