Model checking abilities of agents: a closer look
From MaRDI portal
Publication:2481560
Recommendations
Cites work
- A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic
- About the expressive power of CTL combinators
- Alternating-time logic with imperfect recall
- Alternating-time temporal logic
- An automata-theoretic approach to branching-time model checking
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Comparing semantics of logics for multi-agent systems
- Constructive knowledge: what agents can achieve under imperfect information
- Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
- Decision procedures and expressiveness in the temporal logic of branching time
- Fast planning through planning graph analysis
- scientific article; zbMATH DE number 1705163 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1759629 (Why is no real title available?)
- scientific article; zbMATH DE number 2182496 (Why is no real title available?)
- scientific article; zbMATH DE number 1863184 (Why is no real title available?)
- scientific article; zbMATH DE number 868107 (Why is no real title available?)
- Invariant and geometric aspects of algebraic complexity theory. I
- On epistemic temporal strategic logic
- On the Expressiveness and Complexity of ATL
- Reasoning about rational agents
- Theoretical Computer Science
- “Sometimes” and “not never” revisited
Cited in
(29)- Reasoning about temporal properties of rational play
- Natural strategic ability
- Approximate verification of strategic abilities under imperfect information
- Model checking single agent behaviours by fluid approximation
- Alternating-time logic with imperfect recall
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Synthesis and verification of uniform strategies for multi-agent systems
- Verifying agents with memory is harder than it seemed
- SMC: synthesis of uniform strategies and verification of strategic ability for multi-agent systems
- Specification and Verification of Multi-Agent Systems
- On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking
- Easy Yet Hard: Model Checking Strategies of Agents
- ATL Satisfiability is Indeed EXPTIME-complete
- On the Expressiveness and Complexity of ATL
- Selective Approaches for Solving Weak Games
- Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
- A Logic for Reasoning about Rational Agents
- Parameterised model checking for alternating-time temporal logic
- Model-checking for heterogeneous multi-agent systems
- Artificial Intelligence and Soft Computing - ICAISC 2004
- scientific article; zbMATH DE number 2086522 (Why is no real title available?)
- Multi-valued verification of strategic ability
- Alternating-time temporal logic with finite-memory strategies
- scientific article; zbMATH DE number 7533366 (Why is no real title available?)
- A Hennessy-Milner theorem for ATL with imperfect information
- Theoretical Computer Science
- On the Expressiveness and Complexity of ATL
- Model Checking on Trees with Path Equivalences
- Where logic and agents meet
This page was built for publication: Model checking abilities of agents: a closer look
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481560)
