Logics of time and computation
Logics of time and computation
The three semantics of fuzzy sets
Fuzzy Sets and Systems - Special issue: fuzzy sets: where do we stand? Where do we go?
Artificial Intelligence and Environmental Decision Support Systems
Applied Intelligence
The Semantic Web And Its Languages
IEEE Intelligent Systems
IEEE Intelligent Systems
Impact: A Platform for Collaborating Agents
IEEE Intelligent Systems
Chance Discovery
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
Journal of Logic and Computation
Linear temporal logic with until and before on integer numbers, deciding algorithms
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Temporal Logic for Modeling Discovery and Logical Uncertainty
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Multi-agent logic with distances based on linear temporal frames
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
A framework to compute inference rules valid in agents' temporal logics
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Inference rules in multi-agents' temporal logics
Transactions on computational collective intelligence IV
International Journal of Intelligent Information Technologies
Hi-index | 0.00 |
We study a logic LDU (logic of Discovery in Uncertain Situations) generated in a semantic way as the set of all formulas valid in Krike/Hintikka models, which are models of linear discrete time with time clusters imitating possible uncertain states. The possibility of discoveryand uncertain necessity of discoveryare modeled by modal operations. The logic LDU differs from all standard normal and non-normal modal logics because the modalities ate not mutually expressible in standard way. We discuss properties of this logic, i.e. study its fragments, compare LDU with well known modal logics and study the main question about decidability of this logic. We propose an algorithm recognizing theorems of LDU (so we show that LDU is decidable), which is based on verification of validity of special normal reduced forms of rules in models of quadratic polynomial size in the testing rules.