Results 11 to 20 of about 52,163 (250)
Strategic Coalitions With Perfect Recall [PDF]
Proceedings of the AAAI Conference on Artificial Intelligence, 2018 The paper proposes a bimodal logic that describes an interplay between distributed knowledge modality and coalition know-how modality. Unlike other similar systems, the one proposed here assumes perfect recall by all agents. Perfect recall is captured in the system by a single axiom.
Naumov, Pavel, Tao, Jia
openaire +2 more sources
Alternating-time temporal logic with finite-memory strategies [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Model-checking the alternating-time temporal logics ATL and ATL* with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable.
Steen Vester
doaj +1 more source
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of cooperation ...
Cătălin Dima +2 more
doaj +1 more source
Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.
R van der Meyden, M K Patra
doaj +1 more source
Folk theorems with bounded recall under (almost) perfect monitoring [PDF]
Games and Economic Behavior, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George J. Mailath, Wojciech Olszewski
openaire +4 more sources
Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics [PDF]
CoRR, 2012 We identify a subproblem of the model-checking problem for the epistemic μ-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the scope of epistemic modalities in a restricted form that avoids embodying any form of common knowledge. Our subproblem subsumes known decidable fragments of epistemic CTL/LTL,
Bozianu, Rodica +2 more
openaire +6 more sources
Epistemic ATL with Perfect Recall, Past and Strategy Contexts [PDF]
, 2012 We propose an extension to epistemic ATL with perfect recall, past, and distributed knowledge by strategy contexts and demonstrate the strong completeness of a Hilbert-style proof system for its (.\({\mathsf U}\).)-free subset.
Guelev, Dimitar P., Dima, Catalin
openaire +2 more sources
Multi-speed Multi-load Bearing Diagnostics Using Extended Phase Space Topology
MATEC Web of Conferences, 2018 This paper presents the application of Extended Phase Space Topology (EPST) and conventional statistical time domain features in the diagnostics of various bearing faults in rotating machinery systems.
Haj Mohamad T. +2 more
doaj +1 more source
Decidability Results for ATL* with Imperfect Information and Perfect Recall
International Joint Conference on Autonomous Agents and Multiagent Systems, 2017 Alternating-time Temporal Logic (ATL*) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATL*_i) is well known to have an undecidable model-checking problem when agents have perfect recall. Studies have thus mostly focused either on agents without memory, or on alternative semantics to retrieve decidability.
Berthon R., Maubert B., Murano A.
openaire +4 more sources
ALGEBRAIC EQUATIONS WITH LINEAR SHIFT OPERATORS ON SEQUENCES [PDF]
Romanian Journal of Mathematics and Computer Science, 2016 In this note we recall (see also [8]) the structure of all recurrent sequences which satisfy a fixed recurrence relation, with entries in a perfect field.
SEVER ANGEL POPESCU
doaj