Complexity of multi-agent conformant planning with group knowledge
From MaRDI portal
Logics of knowledge and belief (including belief change) (03B42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)
Cites work
- A Concise Introduction to Models and Methods for Automated Planning
- A logic of goal-directed knowing how
- A Logic of Knowing How
- A Theorem on Boolean Matrices
- Achieving while maintaining: a logic of knowing how with intermediate constraints
- Alternating-time temporal logic
- Chain-monadic second order logic over regular automatic trees and epistemic planning synthesis
- Conditional epistemic planning
- Conformant plans and beyond: principles and complexity
- Constructive knowledge: what agents can achieve under imperfect information
- Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
- DEL-based epistemic planning: decidability and complexity
- Don't plan for the unexpected planning based on plausibility models
- Dynamic Epistemic Logic and Knowledge Puzzles
- Epistemic planning for single- and multi-agent systems
- scientific article; zbMATH DE number 6519681 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 2196600 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- Many-dimensional modal logics: theory and applications
- Merging frameworks for interaction
- More for free: a dynamic epistemic framework for conformant planning over transition systems
- Multi-agent conformant planning with distributed knowledge
- Multi-agent knowing how via multi-step plans: a dynamic epistemic planning based approach
- On axiomatizations of public announcement logic
- On epistemic temporal strategic logic
- Relationships between nondeterministic and deterministic tape complexities
- Resolving distributed knowledge
- Symbolic model checking for temporal-epistemic logic
- The complexity of reasoning about knowledge and time. I: Lower bounds
- The dynamic logic of policies and contingent planning
This page was built for publication: Complexity of multi-agent conformant planning with group knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6836489)
