On composition of bounded-recall plans

DOI10.1016/j.artint.2020.103399zbMath1504.68237OpenAlexW3091994162MaRDI QIDQ2046034

Kaya Deuser, Pavel Naumov

Publication date: 16 August 2021

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2020.103399

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Bounded memory Dolev-Yao adversaries in collaborative systems
• Improving active Mealy machine learning for protocol conformance testing
• Reasoning about coalitional games
• Group announcement logic
• Strategy logic
• A logic of strategic ability under bounded memory
• Finite automata play the repeated prisoner's dilemma
• Evolutionary stability in repeated games played by finite automata
• Rationality and bounded rationality
• Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
• Graded modalities in strategy logic
• The deliberative stit: A study of action, omission, ability, and obligation
• A logic of goal-directed knowing how
• Complete axiomatization and decidability of alternating-time temporal logic
• On the logic of cooperation and propositional control
• On complexity as bounded rationality (extended abstract)
• Calculus of cooperation and game-based reasoning about protocol privacy
• Reasoning About Strategies
• Planning with Incomplete Information
• Logic for coalitions with bounded resources
• Games in Dynamic-Epistemic Logic
• Alternating-time temporal logic
• A Logic of Knowing How
• ATL with Strategy Contexts and Bounded Memory
• Multiagent Systems
• Better Quality in Synthesis through Quantitative Objectives
• Constructive knowledge: what agents can achieve under imperfect information
• A Modal Logic for Coalitional Power in Games
• ACTION TYPES IN STIT SEMANTICS
• Navigability with intermediate constraints
• Coalition logic with individual, distributed and common knowledge1
• Achieving While Maintaining:
• One-Path Reachability Logic
• An axiomatic basis for computer programming

This page was built for publication: On composition of bounded-recall plans