Results 231 to 240 of about 52,163 (250)

Exponential Acceleration of Model Checking for Perfect Recall Systems

2012
We revise the model checking algorithm for combination of Computation Tree Logic and Propositional Logic of Knowledge in finite multiagent systems with a perfect recall synchronous semantics. A new approach is based on data structures that are exponentially smaller than the structures used in the previous versions of the model checking algorithm.
openaire   +1 more source

Psychomotor Task with Perfect Recall after Fifty Weeks of No Practice

Perceptual and Motor Skills, 1964
Seven Ss were trained to varying extents on a difficult balancing task, and then tested after 50 wk. without practice. The learning curves of all but one S continued after the hiatus as if there had been no break in training. The results were compared with those from other studies of long-term retention of motor skills, and various possible ...
openaire   +2 more sources

Tableaux for temporal logics of knowledge: synchronous systems of perfect recall or no learning

10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings., 2004
The paper describes tableaux based proof methods for temporal logics of knowledge allowing interaction axioms between the modal and temporal components. Such logics can be used to specify systems that involve the knowledge of processes or agents and which change over time, for example agent based systems or knowledge games. The interaction axioms allow
Clare Dixon, Cláudia Nalon, Michael Fisher 0001   +2 more
openaire   +2 more sources

Tableaux for Single-Agent Epistemic PDL with Perfect Recall and No Miracles

2015
Epistemic propositional dynamic logic (EPDL) is a combination of epistemic logic and propositional dynamic logic. The properties, perfect recall and no miracles, capture the interactions between actions and knowledge. In this paper, we present a tableau-based decision procedure for deciding satisfiability of single-agent EPDL with perfect recall and no
openaire   +2 more sources

Bounded planning for strategic goals with incomplete information and perfect recall

International Joint Conference on Autonomous Agents and Multiagent Systems, 2013
The paper proposes an OBDD-based bounded model checking algorithm for alternating-time temporal logic in systems of incomplete information and multiple players. Players are assumed to have perfect recall memory over their observations and local actions.
openaire   +2 more sources

Model Checking Knowledge and Time in Systems with Perfect Recall

1999
This paper studies model checking for the modal logic of knowledge and linear time in distributed systems with perfect recall. It is shown that this problem (1) is undecidable for a language with operators for until and common knowledge, (2) is PSPACE-complete for a language with common knowledge but without until, (3) has nonelementary upper and lower
Ron van der Meyden, Nikolay V. Shilov
openaire   +1 more source

Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall

2009
no ...
openaire   +1 more source

Perfect recall

The Lancet, 2007
openaire   +1 more source

Common knowledge in well-structured perfect recall systems

Automatic Control and Computer Sciences, 2015
Natalia Garanina, Garanina N O
exaly  

Reasoning about Strategic Abilities

ACM Transactions on Computational Logic, 2019
Wojciech Jamroga, Nils Bulling
exaly