Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Logic and Uncertainty in Information Retrieval
ESSIR '00 Proceedings of the Third European Summer-School on Lectures on Information Retrieval-Revised Lectures
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Acceptability of arguments as `logical uncertainty'
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Chance Discovery
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
Journal of Logic and Computation
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Exceptions as Chance for Computational Chance Discovery
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Logic of Discovery in Uncertain Situations--- Deciding Algorithms
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
Hi-index | 0.00 |
The paper investigates a new temporal logic ${\mathcal LTL}^{\mathcal Z}_{{\mathcal D}{\mathcal U}}$ combining operations of the linear temporal logic LTL, the operation for discovery and operation for logical uncertainty. Our main aim is to construct a logical framework for modeling logical laws connecting temporal operations and operations of discovery and uncertainty. We consider questions of satisfiability and decidability for ${\mathcal LTL}^{\mathcal Z}_{{\mathcal D}{\mathcal U}}$. Our principal result is found algorithm which recognizes theorems of ${\mathcal LTL}^{\mathcal Z}_{{\mathcal D}{\mathcal U}}$ (which implies that ${\mathcal LTL}^{\mathcal Z}_{{\mathcal D}{\mathcal U}}$ is decidable, and the satisfiability problem for ${\mathcal LTL}^{\mathcal Z}_{{\mathcal D}{\mathcal U}}$ is solvable).