# zbMATH — the first resource for mathematics

Computing truth of logical statements in multi-agents’ environment. (English) Zbl 07325001
Summary: This paper describes logical models and computational algorithms for logical statements (specs) including various versions of Chance Discovery (CD). The approach is based at temporal multi-agent logic. Prime question is how to express most essential properties of CD in terms of temporal logic (branching time multi-agents’ logic or a linear one), how to define CD by formulas in logical language. We, as an example, introduce several formulas in the language of temporal multi-agent logic which may express essential properties of CD. Then we study computational questions (in particular, using some light modification of the standard filtration technique we show that the constructed logic has the finite-model property with effectively computable upper bound; this proves that the logic is decidable and provides a decision algorithm). At the final part of the paper we consider interpretation of CD via uncertainty and plausibility in an extension of the linear temporal logic LTL and computation for truth values (satisfiability) of its formulas.
##### MSC:
 68 Computer science 03 Mathematical logic and foundations
Full Text:
##### References:
 [1] A. Abe, Y. Ohsawa (eds.), Readings in Chance Discovery, International Series on Advanced Intelligence, 2005 [2] A. Abe, K. Kogure, “E-Nightingale: Crisis Detection in Nursing Activities”, Chance Discoveries in Real World Decision Making, 2006, 357-371 [3] A. Abe, Y. Ohsawa, KES Journal, 11:5, Special issue on chance discovery (2007), 255-257 [4] A. Abe, N. Hagita, M. Furutani, Y. Furutani, R. Matsuoka, “Exceptions as Chance for Computational Chance Discovery”, KES 2008, 2008, 750-757 [5] K. Arisha, F. Ozcan, R. Ross, V. S. Subrahmanian, T. Eiter, S. Kraus, “Impact: A platform for collaborating agents”, IEEE Intelligent Systems, 14:2 (1999), 64-72 [6] N. M. Avouris, “Co-operation knowledge-based systems for environmental decision-support”, Knowledge-Based Systems, 8:1 (1995), 39-53 [7] J. Barwise, “Three Views of Common Knowledge”, Proc. Second Conference on Theoretical Aspects of Reasoning about Knowledge (1988, San Francisco, California, Morgan Kaufmann), ed. Moshe Y. Vardi, 365-379 · Zbl 0704.03008 [8] R. J. Brachman, J. G. Schmolze, “An overview on the KL-ONE knowledge representation system”, Cognitive Science, 9:2 (1985), 179-226 [9] C. Dwork, Y. Moses, “Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures”, Information and Computation, 68:2 (1990), 156-183 · Zbl 0705.68019 [10] R. Fagin, J. Halpern, Y. Moses, M. Vardi, Reasoning About Knowledge, The MNT Press, Cambridge, Massachusetts, London, England, 1995 · Zbl 0839.68095 [11] M. Kifer, L. Lozinski, “A Logic for Reasoning with Inconsistency”, J. Automated Deduction, 9 (1992), 171-115 [12] S. Kraus, D. L. Lehmann, “Knowledge, Belief, and Time”, Theoretical Computer Science, 98 (1988), 143-174 [13] K. S. Hahum, “The Window of Opportunity: Logic and Chance in Becquerel”s Discovery of Radioactivity”, Physics in Perspective (PIP), 2:1 (2000), 63-99 [14] J. Hendler, “Agents and the semantic web”, IEEE Intelligent Systems, 16:2 (2001), 30-37 [15] L. Magnani, “Abduction and chance discovery in science”, International J. of Knowledge-Based and Intelligent Engineering Systems, 12 (2008) [16] Y. Moses, Y. Shoham, “Belief and Defeasible Knowledge”, Artificial Intelligence, 64:2 (1993), 299-321 · Zbl 0787.68095 [17] G. Neiger, M. R. Tuttle, “Common knowledge and consistent simultaneous coordination”, Distributed Computing, 5:3 (1993), 334-352 · Zbl 0781.68025 [18] B. Nebel, Reasoning and Revision in Hybrid Representation Systems, Lecture Notes in Computer Science, 322, Springer Verlag, 1940 · Zbl 0702.68095 [19] N. T. Nguyen et al. (eds.), Proceedings of KES-AMSTA 2008, Lecture Notes in Artificial Intelligence, 4953, Springer-Verlag, 2008 [20] N. T. Nguyen, D. S. Huang, “Knowledge Management for Autonomous Systems and Computational Intelligence”, Journal of Universal Computer Science, 15:4 (2009), 704 [21] N. T. Nguyen, R. Katarzyniak, “Actions and Social Interactions in Multi-agent Systems”, International Journal of Knowledge and Information Systems, 18:1, Special issue (2009), 133-136 [22] J. Quantz, B. Schmitz, “Knowledge-based disambiguation for machine translation”, Minds and Machines, 4:2 (1994), 39-57 [23] Y. Ohsawa, P. McBurney, Chance Discovery, Advanced Information Processing, Springer Verlag, 2003 [24] Y. Ohsawa, “Chance Discovery with Emergence of Future Scenarios”, KES, 2004, 11-12 [25] Y. Ohsawa, “Chance Discovery, Data-based Decision for Systems Design”, ISDA (2006) [26] Y. Ohsawa, M. Ishii, “Gap between advertisers and designers: Results of visualizing messages”, International J. of Knowledge-Based and Intelligent Engineering Systems, 12 (2008) [27] V. V. Rybakov, “Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms”, Computer Science — Theory and Applications, Lecture Notes in Computer Science, 3967, Springer, 2006, 322-334 · Zbl 1185.03022 [28] V. V. Rybakov, “Until-Since Temporal Logic Baed on Parallel Time with Common Past. Deciding Algorithms”, Logical Foundations of Computer Science, LFCS (2007, New York, USA), Lecture Notes in Computer Science, 4514, eds. S. Artemov, A. Nerode, 2007, 486-497 · Zbl 1132.03324 [29] S. Babenyshev, V. V. Rybakov, “Describing Evolutions of Multi-Agent Systems”, KES (2009), v. 1, Lecture Notes in Computer Science, 5711, Springer, 2009, 38-45 [30] V. V. Rybakov, “Linear Temporal Logic $$LTK_K$$ extended by Multi-Agent Logic $$K_n$$ with Interacting Agents”, J. Log. Comput., 19:6 (2009), 989-1017 · Zbl 1208.03023 [31] V. V. Rybakov, “Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents”, IJIIT, 6:1 (2010), 31-45 [32] V. V. Rybakov, “Interpretation of Chance Discovery in Temporal Logic, Admissible Inference Rules”, KES (2010), v. 3, Lecture Notes in Computer Science, 6278, Springer, 2010, 323-330 [33] V. V. Rybakov, “Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents”, IJIIT, 6:1 (2010), 31-45 [34] A. T. Steinberg, A chance for possibility: an investigation into the grounds of modality, Doctoral thesis, UCL (University College London), 2011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.