-
1
-
-
0042908709
-
Alternating-time temporal logic
-
R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. J. ACM, 49(5):672-713, 2002.
-
(2002)
J. ACM
, vol.49
, Issue.5
, pp. 672-713
-
-
Alur, R.1
Henzinger, T.A.2
Kupferman, O.3
-
2
-
-
48949092040
-
Coalitions in action logic
-
M. M. Veloso, editor, Hyderabad, India
-
S. Borgo. Coalitions in action logic. In M. M. Veloso, editor, Proceedings IJCAI'07, pages 1822-1827, Hyderabad, India, 2007.
-
(2007)
Proceedings IJCAI'07
, pp. 1822-1827
-
-
Borgo, S.1
-
3
-
-
0004356882
-
Finding hard instances of the satisfiability problem: A survey
-
D. Du, J. Gu, and P. M. Pardalos, editors, Satisfiability Problem: Theory and Applications
-
S. A. Cook and D. G. Mitchell. Finding hard instances of the satisfiability problem: A survey. In D. Du, J. Gu, and P. M. Pardalos, editors, Satisfiability Problem: Theory and Applications, volume 35 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 1-17, 1997.
-
(1997)
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
, vol.35
, pp. 1-17
-
-
Cook, S.A.1
Mitchell, D.G.2
-
4
-
-
0001449325
-
Temporal and modal logic
-
Formal Models and Semantics, MIT Press, Cambridge, MA, USA
-
E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science (vol. B): Formal Models and Semantics, pages 995-1072. MIT Press, Cambridge, MA, USA, 1990.
-
(1990)
Handbook of Theoretical Computer Science
, vol.B
, pp. 995-1072
-
-
Emerson, E.A.1
-
5
-
-
84943225005
-
Planning as model checking
-
S. Biundo and M. Fox, editors, Recent Advances in AI Planning Springer-Verlag: Berlin, Germany
-
F. Giunchiglia and P. Traverso. Planning as model checking. In S. Biundo and M. Fox, editors, Recent Advances in AI Planning (LNAI Volume 1809), pages 1-20. Springer-Verlag: Berlin, Germany, 1999.
-
(1999)
LNAI
, vol.1809
, pp. 1-20
-
-
Giunchiglia, F.1
Traverso, P.2
-
6
-
-
33244455654
-
Complete axiomatization and decidability of Alternating-time Temporal Logic
-
DOI 10.1016/j.tcs.2005.07.043, PII S0304397505007255
-
V. Goranko and G. van Drimmelen. Complete axiomatization and decidability of alternating-time temporal logic. Theoretical Computer Science, 353(1-3):93-117, 2006. (Pubitemid 43277729)
-
(2006)
Theoretical Computer Science
, vol.353
, Issue.1-3
, pp. 93-117
-
-
Goranko, V.1
Van Drimmelen, G.2
-
7
-
-
0042407900
-
Logic for Social Software
-
PhD thesis, University of Amsterdam
-
M. Pauly. Logic for Social Software. PhD thesis, University of Amsterdam, 2001. ILLC Dissertation Series 2001-10.
-
(2001)
ILLC Dissertation Series 2001-10
-
-
Pauly, M.1
-
8
-
-
18844453205
-
Alternating-time logic with imperfect recall
-
DOI 10.1016/S1571-0661(05)82604-0, PII S1571066105826040, LCMAS 2003, Logic and Communication in Multi-Agent Systems
-
P. Schobbens. Alternating-time logic with imperfect recall. Electronic Notes in Computer Science, 85(2):82-93, 2004. (Pubitemid 40679073)
-
(2004)
Electronic Notes in Theoretical Computer Science
, vol.85
, Issue.2
, pp. 82-93
-
-
Schobbens, P.-Y.1
-
9
-
-
34247278817
-
A logic for strategic reasoning
-
New York, NY, USA, ACM Press
-
W. van der Hoek, W. Jamroga, and M. Wooldridge. A logic for strategic reasoning. In AAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, pages 157-164, New York, NY, USA, 2005. ACM Press.
-
(2005)
AAMAS '05: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems
, pp. 157-164
-
-
Van Der Hoek, W.1
Jamroga, W.2
Wooldridge, M.3
-
10
-
-
0042433187
-
Satisfiability in alternating-time temporal logic
-
Washington, DC, USA, IEEE Computer Society
-
G. van Drimmelen. Satisfiability in alternating-time temporal logic. In LICS '03: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, 22-25 June 2003, Ottawa, Canada, pages 208-217, Washington, DC, USA, 2003. IEEE Computer Society.
-
(2003)
LICS '03: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, 22-25 June 2003, Ottawa, Canada
, pp. 208-217
-
-
Van Drimmelen, G.1
-
11
-
-
33750350599
-
ATL satisfiability is indeed Exptime-complete
-
D. Walther, C. Lutz, F. Wolter, and M. Wooldridge. ATL satisfiability is indeed Exptime-complete. Journal of Logic and Computation, 16:765-787, 2006.
-
(2006)
Journal of Logic and Computation
, vol.16
, pp. 765-787
-
-
Walther, D.1
Lutz, C.2
Wolter, F.3
Wooldridge, M.4
|