Armstrong's Axioms and Navigation Strategies
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 the database theory. If the assumption of perfect recall is omitted, then Armstrong's transitivity axiom is not valid, but it can be replaced by two new weaker principles. The main technical results are soundness and completeness theorems for the logical systems describing properties of navigability with and without perfect recall.
Code (0)
등록된 구현이 없습니다.
Tasks
validSimilar Papers 제목 키워드 기반
Obituary: In Memoriam: Susan Armstrong
Strategies in deterministic totally-ordered-time games
We consider deterministic totally-ordered-time games. We present three axioms for strategies. We show that for any tuple of strategies that satisfy the axioms, there exists a unique complete history that is consistent wi…
Axiomatic Equilibrium Selection: The Case of Generic Extensive Form Games
A solution concept that is a refinement of Nash equilibria selects for each finite game a nonempty collection of closed and connected subsets of Nash equilibria as solutions. We impose three axioms for such solution conc…
FormOntology Learning with LLMs: A Benchmark Study on Axiom Identification
Ontologies are an important tool for structuring domain knowledge, but their development is a complex task that requires significant modelling and domain expertise. Ontology learning, aimed at automating this process, ha…
On the Logic of Causal Models
This paper explores the role of Directed Acyclic Graphs (DAGs) as a representation of conditional independence relationships. We show that DAGs offer polynomially sound and complete inference mechanisms for inferring con…
valid