Epistemic Logic of Know-Who
Authors: Sophia Epstein, Pavel Naumov11479-11486
AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | The paper suggests a deļ¬nition of know who as a modality using Grove-Halpern semantics of names. It also introduces a logical system that describes the interplay between modalities knows who , knows , and for all agents . The main technical result is a completeness theorem for the proposed system. |
| Researcher Affiliation | Academia | 1 Claremont Mc Kenna College 2 King s College sepstein22@cmc.edu, pgn2@cornell.edu |
| Pseudocode | No | The paper describes a logical system and its proofs but does not include any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any statement or link about the availability of open-source code for the described methodology. |
| Open Datasets | No | This paper is theoretical and does not use datasets for training or evaluation. |
| Dataset Splits | No | This paper is theoretical and does not involve data splits for training, validation, or testing. |
| Hardware Specification | No | This paper is theoretical and does not conduct experiments, thus no hardware specifications are mentioned. |
| Software Dependencies | No | The paper describes a theoretical logical system and does not list any specific software dependencies with version numbers. |
| Experiment Setup | No | This paper is theoretical and does not conduct experiments, thus no experimental setup details or hyperparameters are provided. |