On satisfiability in ATL with strategy contexts
DOI10.1007/978-3-642-33353-8_31zbMATH Open1362.68269OpenAlexW196035745MaRDI QIDQ2915087FDOQ2915087
Authors: Nicolas Troquard, D. Walther 
Publication date: 21 September 2012
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33353-8_31
Recommendations
Cooperative games (91A12) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
- Alternating-time temporal logic
- Many-dimensional modal logics: theory and applications
- Properties of logics of individual and group agency
- A STIT-Extension of ATL
- Agency and deontic logic
- Title not available (Why is that?)
- The word problem for cancellation semigroups with zero
- The equational theory of CA3 is undecidable
- On languages with two variables
- Complexity of products of modal logics
- ATL with strategy contexts: expressiveness and model checking
- Nonfinitizability of classes of representable polyadic algebras
- Title not available (Why is that?)
- On the Expressiveness and Complexity of ATL
- ATL with Strategy Contexts and Bounded Memory
- On satisfiability in ATL with strategy contexts
Cited In (7)
- Augmenting ATL with strategy contexts
- ATL with strategy contexts: expressiveness and model checking
- On satisfiability in ATL with strategy contexts
- Satisfiability of \textsf{ATL} with strategy contexts
- Title not available (Why is that?)
- ATL with Strategy Contexts and Bounded Memory
- Title not available (Why is that?)
This page was built for publication: On satisfiability in ATL with strategy contexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915087)
