Logic of knowledge and discovery via interacting agents - Decision algorithm for true and satisfiable statements

Authors:
Vladimir Rybakov
Affiliations:
Department of Computing and Mathematics, Manchester Metropolitan University, John Dalton Building, Chester Street, Manchester M1 5GD, UK and Siberian Federal University, av. Svobodnw 49, Krasnoyar ...
Venue:
Information Sciences: an International Journal
Year:
2009

Citing 12
Cited 3

Reasoning about knowledge

Reasoning about knowledge
A logic for information flow in object-oriented programs

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introducing Justification into Epistemic Logic

Journal of Logic and Computation
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals

Journal of Logic and Computation
A logic for information flow analysis with an application to forward slicing of simple imperative programs

Science of Computer Programming
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
Detection of stock price movements using chance discovery and genetic programming

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
Branching Time Logics $\mathcal {BTL}^{\mathrm {U,S}}_{\mathrm {N},\mathrm {N}^{-1}}(\mathcal {Z})_{\alpha }$ with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms

Theory of Computing Systems
Topological semantics of justification logic

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
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

Modeling a resource contention in the management of virtual organizations

Information Sciences: an International Journal
A first step towards argumentation dialogues for discovery

TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Architecture and protocol for intercloud communication

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this paper we study logical properties of the operation chance discovery (CD) via structures based on special Kripke/Hintikka models. These models use as bases partially ordered sets of indexes (indexes of steps in a computation, or ones indicating time points in a time flow), and clusters of states associated to each index. The language chosen to build the logical formulas includes modal/temporal operations, operations for the agents' knowledge, local and global operations for CD, operation of local common knowledge, and an operation for chance of discovery via agents' interactions. We introduce and study a logic (of knowledge and discovery via interaction of agents), LDK"a, which is defined by semantics, as the set of all formulas that are valid in all suggested models. The paper provides an algorithm to recognize logical laws (and satisfiable formulas) of LDK"a. The algorithm replaces a formula with a rule in a special, so-called reduced normal form, and, then it verifies the validity of this rule in specific models of exponential size in the size of the rule. We show that the problem of computing the true logical laws of LDK"a is decidable.