Logics of time and computation
Logics of time and computation
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Hereditarily structurally complete modal logics
Journal of Symbolic Logic
Reasoning about knowledge
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Chance Discovery
Two Natural Deduction Systems for Hybrid Logic: A Comparison
Journal of Logic, Language and Information
Reasoning about common knowledge with infinitely many agents
Information and Computation
Natural Deduction for Hybrid Logic
Journal of Logic and Computation
Chance Discovery: Data-based Decision for Systems Design
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 01
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
Journal of Logic and Computation
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
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
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
| Hi-index | 0.00 |
The paper constructs a mathematical model for logical properties of Chance Discovery (CD) based on Linear Temporal Logic (LTL). We study an extension LTLIACD of LTL by implementing multi-agent knowledge logic Km and special operations to model discovery: discoverable via interaction (unary) operation DIA and (unary) operations for local and global discovery: ◊D,l and ◊D,g. We prove that LTLIACD is decidable and extend this result to a linear temporal logic LTLIACD (Z) based on the time flow indexed by all integer numbers.