Multi-Agent Belief Base Revision

Authors: Emiliano Lorini, Francois Schwarzentruber

IJCAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We provide complexity results of model checking for our approach as well as an optimal model checking algorithm. Moreover, we study complexity of epistemic planning formulated in the context of our framework. Sections 4 and 5 are devoted, respectively, to the formulation of model checking and epistemic planning in our setting and to the study and their complexities.
Researcher Affiliation Academia 1IRIT-CNRS, Toulouse University, France 2Univ Rennes, IRISA, CNRS, France emiliano.lorini@irit.fr, francois.schwarzentruber@ens-rennes.fr
Pseudocode Yes Algorithm 1 Generic algorithm for model checking. procedure mc(B, ϕ)
Open Source Code No The paper does not include any statements about releasing source code or provide a link to a code repository.
Open Datasets No The paper is theoretical and does not involve empirical studies with datasets for training, validation, or testing.
Dataset Splits No The paper is theoretical and does not involve empirical studies with datasets, therefore, no training/validation/test splits are provided.
Hardware Specification No The paper is theoretical and does not describe any specific hardware used for running experiments.
Software Dependencies No The paper is theoretical and does not mention any specific software dependencies with version numbers required for replication of experiments.
Experiment Setup No The paper is theoretical and does not describe any experimental setup details, hyperparameters, or training configurations.