Navigability with Bounded Recall
Navigability with Bounded Recall
The paper studies navigability by machines with bounded recall in mazes with imperfect information. The main result is a sound and complete logical system for the relation “there is a machine with at most n states that can navigate from a set
of classes of indistinguishable rooms X to a set of classes of indistinguishable rooms Y ”. The axioms of the system generalize Armstrong’s axioms of functional dependency from database theory.
635-636
Deuser, Kaya
23a1de64-9965-4ce3-9cf5-33546306002b
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
2018
Deuser, Kaya
23a1de64-9965-4ce3-9cf5-33546306002b
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Deuser, Kaya and Naumov, Pavel
(2018)
Navigability with Bounded Recall.
In Principles Of Knowledge Representation And Reasoning: Proceedings Of The Sixteenth International Conference (Kr2018).
AAAI Press.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
The paper studies navigability by machines with bounded recall in mazes with imperfect information. The main result is a sound and complete logical system for the relation “there is a machine with at most n states that can navigate from a set
of classes of indistinguishable rooms X to a set of classes of indistinguishable rooms Y ”. The axioms of the system generalize Armstrong’s axioms of functional dependency from database theory.
Text
2018-kr-dn
- Author's Original
More information
Published date: 2018
Identifiers
Local EPrints ID: 479618
URI: http://eprints.soton.ac.uk/id/eprint/479618
PURE UUID: 48f308d5-09f6-421a-a185-80516d9de9ba
Catalogue record
Date deposited: 26 Jul 2023 16:41
Last modified: 17 Mar 2024 04:10
Export record
Contributors
Author:
Kaya Deuser
Author:
Pavel Naumov
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics