Logic of Discovery and Knowledge: Decision Algorithm

Authors:
Sergey Babenyshev;Vladimir Rybakov
Affiliations:
Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, U.K. M1 5GD and Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia 660041;Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, U.K. M1 5GD and Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia 660041
Venue:
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Year:
2008

Citing 10
Cited 1

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
Agents and the Semantic Web

IEEE Intelligent Systems
Impact: A Platform for Collaborating Agents

IEEE Intelligent Systems
Chance Discovery

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

Representation of knowledge and uncertainty in temporal logic LTL with since on frames Z of integer numbers

KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The logic of Chance Discovery(CD) as well as mathematical models for CD, by the very nature of the term chance, are hard to formalize, which poses challenging problems for mathematization of the area. It does not completely prevent us though from studying the logical lawswhich chance discovery and related notions should abide, especially in a carefully chosen and reasonably expressive mathematical formalism. The framework, the authors suggest in this paper, is based on a well-developed area of modal logic, more precisely on Kripke-Hintikka semantics, with a notable distinction: unlike some other hybridization schemes, it leads to decidable logics, while still preserving high expressive power. We demonstrate our approach by an example of the Logic of Discovery and Knowledge, where a regular modal language is augmented with higher level operators intended to model some contrasting aspects of Chance Discovery: uncertain necessity of discoveryand local common knowledgewithin contexts admitting branching time.