Voir la notice de l'article provenant de la source Math-Net.Ru
@article{JSFU_2024_17_5_a12, author = {Vladimir R. Kiyatkin and Vladimir V. Rybakov}, title = {Interval multi-agent logic with reliability operator}, journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika}, pages = {679--683}, publisher = {mathdoc}, volume = {17}, number = {5}, year = {2024}, language = {en}, url = {http://geodesic.mathdoc.fr/item/JSFU_2024_17_5_a12/} }
TY - JOUR AU - Vladimir R. Kiyatkin AU - Vladimir V. Rybakov TI - Interval multi-agent logic with reliability operator JO - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika PY - 2024 SP - 679 EP - 683 VL - 17 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/JSFU_2024_17_5_a12/ LA - en ID - JSFU_2024_17_5_a12 ER -
%0 Journal Article %A Vladimir R. Kiyatkin %A Vladimir V. Rybakov %T Interval multi-agent logic with reliability operator %J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika %D 2024 %P 679-683 %V 17 %N 5 %I mathdoc %U http://geodesic.mathdoc.fr/item/JSFU_2024_17_5_a12/ %G en %F JSFU_2024_17_5_a12
Vladimir R. Kiyatkin; Vladimir V. Rybakov. Interval multi-agent logic with reliability operator. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 17 (2024) no. 5, pp. 679-683. http://geodesic.mathdoc.fr/item/JSFU_2024_17_5_a12/
[1] R.Fagin, J.Y.Halpern, Yoram Moses and Moshe Vardi, MIT, 1995
[2] V.V.Rybakov, “Refined common knowledge logics or logics of common information”, Archive for Mathematical Logic, 42 (2003), 179–200 | DOI | MR | Zbl
[3] S.Artemov, Evidence-Based Common Knowledge, Technical Report TR-2004018 CUNY Ph.D. Program in Computer Science (revised version), 2006 | MR
[4] S.Artemov, “Explicit Generic Common Knowledge”, Lect/ Notes in CS, LFCS 2013, Logical Foundations of Computer Science, 2013, 16–28
[5] S.Artemov, “Justification awareness”, Journal of Logic and Computation, 30:8 (2020), 1431–1446 | DOI | MR | Zbl
[6] V.Rybakov, “Temporal Multi-Agent’s Logic, Knowledge, Uncertainty, and Plausibility”, Agents and Multi-Agent Systems: Technologies and Applications, LNCS, 2021, 205–214
[7] S.Babenyshev, V.Rybakov, “Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL”, CiE 2008, Lecture Notes in Computer Science, 5028, 2008, 32–41 | DOI | MR | Zbl
[8] S.Babenyshev, V.Rybakov, “Logic of Discovery and Knowledge: Decision Algorithm”, KES 2008, Lecture Notes in Computer Science, 5178, 2008, 711–718 | DOI
[9] S.Babenyshev, V.Rybakov, “Describing Evolutions of Multi-Agent Systems”, KES 2009, Lecture Notes in Computer Science, 5711, 2009, 38–45 | DOI
[10] F.Baader, “Sattler Expressive Number Restrictions in Description Logics”, J. Log. Comput., 9:3 (1999), 319–350 | DOI | MR | Zbl
[11] F.Belardinelli, A.Lomuscio, “Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results”, Journal of Artificial Intelligence Research, 45 (2012), 1–45 | DOI | MR | Zbl
[12] I.Horrocks, U.Sattler, A Description Logic with Transitive and Inverse Roles and Role Hierarchies, Description Logics, 1998 | MR
[13] I.Horrocks, M.Giese, E.Kharlamov, A.Waaler, “Using Semantic Technology to Tame the Data Variety Challenge”, IEEE Internet Computing, 20:6 (2016), 62–66 | DOI
[14] V.V.Rybakov, Non-transitive linear temporal logic and logical knowledge operations, J. Logic and Computation, 26:3 (2016), 945–958 | DOI | MR | Zbl
[15] V.V.Rybakov, “Temporal logic with overlap temporal relations generated by time states themselves”, Siberian Mathematical Reports, 17 (2020), 923–932 | MR | Zbl
[16] V.V.Rybakov, “Multi-agent temporal nontransitive linear logics and the admissibility problem”, Algebra and Logic, 59 (2020), 87–100 | DOI | MR | Zbl
[17] V.V.Rybakov, “Branching Time Logics with Multiagent Temporal Accessibility Relations”, Siberian Mathematical Journal, 62:3 (2021), 503–510 | DOI | MR | Zbl
[18] M.Wooldridge, “An Automata-theoretic approach to multi-agent planning”, Proceedings of the First European Workshop on Multi-agent Systems (EUMAS) (December 2003), Oxford University | Zbl