Chance discovery and unification in linear modal logic

Authors:
Vladimir V. Rybakov
Affiliations:
School of Computing, Mathematics and IT, Manchester Metropolitan University, Manchester, UK and Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia
Venue:
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
Year:
2011

Citing 14
Cited 0

Temporal logic (vol. 1): mathematical foundations and computational aspects

Temporal logic (vol. 1): mathematical foundations and computational aspects
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Chance Discovery

Chance Discovery
Chance Discovery: Data-based Decision for Systems Design

ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 01
Abduction and chance discovery in science

International Journal of Knowledge-based and Intelligent Engineering Systems - Chance discovery
Gap between advertisers and designers: Results of visualizing messages

International Journal of Knowledge-based and Intelligent Engineering Systems - Chance discovery
Special issue on chance discovery

International Journal of Knowledge-based and Intelligent Engineering Systems - Chance discovery
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
Linear Temporal Logic LTLK extended by Multi-Agent Logic Kn with Interacting Agents

Journal of Logic and Computation
Describing Evolutions of Multi-Agent Systems

KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Interpretation of chance discovery in temporal logic, admissible inference rules

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
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
Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents

International Journal of Intelligent Information Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies an interpretation of the Chance Discovery (CD) as the unification problem in the linear modal logic S4.3. We prove that any formula unifiable in S4.3 has a most general unifier, and we give an algorithm which, for any unifiable formula, constructs a most general unifier. More precisely, we merely write out, explicitly, the formulas giving substitutions for a most-general unifier. From computational viewpoint, we find an algorithm for the construction of sets of 'best unifiers' (complete collections of 'most' general unifiers) in the linear modal logic S4.3.