Results 1 to 10 of about 52,064 (151)
Common Knowledge in Well-structured Perfect Recall Systems
Моделирование и анализ информационных систем, 2013 We investigate a model checking problem for the logic of common knowledge and fixpoints µPLCn in well-structured multiagent systems with perfect recall.
N. O. Garanina
doaj +5 more sources
Backward induction in games without perfect recall [PDF]
Games and Economic Behavior, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dmitriy Kvasov, John Hillas
exaly +2 more sources
Memory and perfect recall in extensive games [PDF]
Games and Economic Behavior, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giacomo Bonanno
exaly +4 more sources
Practice makes perfect in memory recall [PDF]
Learning and Memory, 2016 A large variability in performance is observed when participants recall briefly presented lists of words. The sources of such variability are not known. Our analysis of a large data set of free recall revealed a small fraction of participants that reached an extremely high performance, including many trials with the recall of complete lists.
Sandro Romani +2 more
exaly +3 more sources
Dendritic Inhibition Effects in Memory Retrieval of a Neuromorphic Microcircuit Model of the Rat Hippocampus [PDF]
Brain SciencesBackground: Studies have shown that input comparison in the hippocampus between the Schaffer collateral (SC) input in apical dendrites and the perforant path (PP) input in the apical tufts dramatically changes the activity of pyramidal cells (PCs ...
Nikolaos Andreakos, Vassilis Cutsuridis
doaj +2 more sources
Bounded model checking of strategy ability with perfect recall
Artificial Intelligence, 2015 The paper works with a logic which has the expressiveness to quantify over strategies of bounded length. The semantics of the logic is based on systems with multiple agents. Agents have incomplete information about the underlying system state and their strategies are based on perfect recall memory over observations and local actions.
Xiaowei Huang
exaly +2 more sources
PERFECT RECALL AND PRUNING IN GAMES WITH IMPERFECT INFORMATION [PDF]
Computational Intelligence, 1996 Games with imperfect information are an interesting and important class of games. They include most card games (e.g., bridge and poker) as well as many economic and political models. Here we investigate algorithms for findi ng the simplest form of a solution (a pure‐strategy equilibrium point) to imperfect information games expressed in their extensive
Jean R. S. Blair +2 more
exaly +4 more sources
Perfect‐Recall and Bootstrapping Reasoning
Theoria (Stockholm)ABSTRACT Bootstrapping is a suspicious form of reasoning that seems to allow agents to gain knowledge about the reliability of their sources of information ‘from thin air’, without gathering independent evidence about those sources. The bootstrapping problem is the problem of explaining what is wrong with bootstrapping reasoning.
Michael Cohen
exaly +3 more sources
Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time [PDF]
2009 16th International Symposium on Temporal Representation and Reasoning, 2009 This paper presents various semantic interpretations for logics of knowledge and time with prefect recall. We allow both past and future operators and examine the interpretation of different linear flows of time. In particular, we present temporal epistemic logics for each of the following flows of time: arbitrary linear orders; the integers; the ...
Tim French +2 more
exaly +2 more sources
Binary Associative Memories with Complemented Operations
International Journal of Applied Mathematics and Computer Science, 2023 Associative memories based on lattice algebra are of great interest in pattern recognition applications due to their excellent storage and recall properties.
Gamino-Carranza Arturo
doaj +1 more source