Common Knowledge of Abstract Groups

Authors: Merlin Humml, Lutz Schröder

AAAI 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We show that AGEL is EXPTIMEcomplete, with the lower bound established by reduction from standard group epistemic logic, and the upper bound by a satisfiability-preserving embedding into the full µ-calculus. Further main results include a finite model property (not enjoyed by the full µ-calculus) and a complete axiomatization.
Researcher Affiliation Academia Merlin Humml, Lutz Schr oder Friedrich-Alexander-Universit at Erlangen-N urnberg, Erlangen, Germany {merlin.humml, lutz.schroeder}@fau.de
Pseudocode No The paper does not contain structured pseudocode or algorithm blocks. It describes logical systems and transformations but without code-like formatting.
Open Source Code No The paper does not provide concrete access to source code. It makes no mention of code availability, repositories, or supplementary materials containing code.
Open Datasets No The paper is theoretical and does not use datasets for training. Thus, it does not provide concrete access information for a publicly available or open dataset.
Dataset Splits No The paper is theoretical and does not involve dataset splits for validation. Therefore, it does not provide specific dataset split information.
Hardware Specification No The paper is theoretical and does not involve experiments that would require specific hardware. Therefore, it does not provide specific hardware details.
Software Dependencies No The paper is theoretical and focuses on logic and complexity. It does not mention any specific software dependencies with version numbers for implementation or experimentation.
Experiment Setup No The paper is theoretical and does not describe experimental setups, hyperparameters, or training settings.