|Title:||A decidable multi-agent logic with iterations of upper and lower probability operators||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||10833 LNCS||First page:||170||Last page:||185||Conference:||10th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2018; Budapest; Hungary; 14 May 2018 through 18 May 2018||Issue Date:||1-Jan-2018||Rank:||M33||ISBN:||978-3-319-90049-0||ISSN:||0302-9743||DOI:||10.1007/978-3-319-90050-6_10||Abstract:||
We present a propositional logic for reasoning about higher-order upper and lower probabilities. The main technical result is the proof of decidability of the introduced logical system. We also show that the axiomatization for the corresponding logic without iterations of operators, which we developed in our previous work, is also complete for the new class of models presented in this paper.
|Keywords:||Completeness theorem | Decidability | Probabilistic logic | Upper and lower probabilities||Publisher:||Springer Link||Project:||Advanced Techniques of Cryptology, Image Processing and Computational Topology for Information Security
Representations of logical structures and formal languages and their application in computing
Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education
SNSF project 200021 165549
Show full item record
checked on Jan 31, 2023
checked on Feb 1, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.