The satisfiability problem in linear multi-agent knowledge logic based on N

DOI10.26516/1997-7670.2024.49.124MaRDI QIDQ6643441zbMATH OpenFDO

Authors Nikita Aleksandrovich Protsenko, Vladimir Rybakov

Publication date 26 November 2024

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26516/1997-7670.2024.49.124

zbMATH Keywords

common knowledgedeciding algorithmsmodal logicmultiagent logictemporal logic

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Modal logic (including the logic of norms) (03B45)

Cites work

• Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
• scientific article; zbMATH DE number 3129315 (Why is no real title available?)
• scientific article; zbMATH DE number 4154410 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• Interactions between knowledge and time in a first-order logic for multi-agent systems: completeness results
• Many-valued multi-modal logics, satisfiability problem
• Multiagent temporal logics with multivaluations
• Non-transitive linear temporal logic and logical knowledge operations
• Refined common knowledge logics or logics of common information
• Satisfiability problem in interval FP-logic

This page was built for publication: The satisfiability problem in linear multi-agent knowledge logic based on \(\mathbb{N}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643441)