Kaya Deuser

dblp:203/8467 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
1since 2021 · last 2021
0000-0002-1090-3591ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-authorTheory of computation · 3 · 3 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
YearPublicationVenuePosition
2021 Strategic Knowledge Acquisition
abstract
The article proposes a trimodal logical system that can express the strategic ability of coalitions to learn from their experience. The main technical result is the completeness of the proposed system.
Kaya Deuser, Pavel Naumov
ACM Trans. Comput. Log.1
2020 On composition of bounded-recall plans
Kaya Deuser, Pavel Naumov
Artif. Intell.1
2018 Armstrong's Axioms and Navigation Strategies
abstract
The paper investigates navigability with imperfect information. It shows that the properties of navigability with perfect recall are exactly those captured by Armstrong's axioms from database theory. If the assumption of perfect recall is omitted, then Armstrong's transitivity axiom is not valid, but it can be replaced by a weaker principle. The main technical results are soundness and completeness theorems for the logical systems describing properties of navigability with and without perfect recall.
Kaya Deuser, Pavel Naumov
AAAI1
2018 Navigability with Bounded Recall
Kaya Deuser, Pavel Naumov
KR1
2018 Navigability with intermediate constraints
abstract
The article studies navigability of an autonomous agent in a maze where some rooms may be indistinguishable. In a previous work the authors have shown that the properties of navigability in such a setting depend on whether an agent has perfect recall. Navigability by strategies with perfect recall is a transitive relation and navigability by memoryless strategies is not. Independently, Li and Wang proposed a notion of navigability with intermediate constraints for linear navigation strategies. Linear strategies are different from both perfect recall and memoryless strategies. This article shows that a certain form of transitivity, expressible in the language with intermediate constraints, holds for memoryless strategies. The main technical result is a sound and complete logical system describing the properties of memoryless strategies in the language with intermediate constraints.
Kaya Deuser, Pavel Naumov
J. Log. Comput.1