Good friends are hard to find!

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 2008, Pages 32-40

  Brihaye, Thomas ^a   Markey, Nicolas ^b   Ghannem, Mohamed ^c   Rieg, Lionel ^d  

^a UNIVERSITY OF MONS   (Belgium)

^b CNRS   (France)

^c UNIVERSITY OF MANOUBA   (Tunisia)

^d UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; NP-COMPLETE; OPTIMAL SIZE; ORIGINAL PROBLEM;

GAME THEORY;

EID: 51549109607     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2008.10     Document Type: Conference Paper

References (25)

1. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. J. ACM, 49(5):672-713, Sept. 2002.
2. J. R. Büchi and L. H. Landweber. Solving sequential conditions by finite-state strategies. Trans. of the AMS, 138:295-311, Apr. 1969.
3. W. Chan. Temporal-logic queries. In Proc. 12th Intl Conf. Computer Aided Verification (CAV'00), LNCS 1855, p. 450-463. Springer, July 2000.
4. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model checker. Intl Journal Software Tools for Technology Transfer, 2(4):410-425, Mar. 2000.
5. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logic of Programs, LNCS 131, p. 52-71. Springer, 1981.
6. V. Conitzer and T. Sandholm. Complexity of constructing solutions in the core based on synergies among coalitions. Artif. Intel., 170(6-7):607-619, 2006.
7. V. D. Dang, R. K. Dash, A. Rogers, and N. R. Jennings. Overlapping coalition formation for efficient data fusion in multi-sensor networks. In Proc. 21st Nat. Conf. Artificial Intelligence (AAAI'06) and 18th Innovative Applications of Artificial Intelligence Conf. (IAAF06). AAAI Press, 2006.
8. V. Goranko. Coalition games and alternating temporal logics. In J. van Benthem, editor, Proc. 8th Conf. Theoretical Aspects of Rationality and Knowledge (TARK'01), p. 259-272. Morgan Kaufmann Publishers. July 2001.
9. G. J. Holzmann. The model checker SPIN. IEEE Trans. Software Engineering, 23(5):279-295, May 1997.
10. S. Hornus and Ph. Schnoebelen. On solving temporal logic queries. In Proc. 9th Intl Conf. Algebraic Methodology and Software Technology (AMAST'02), LNCS 2422, p. 163-177. Springer, Sept. 2002.
11. M. W. Krentel. The Complexity of Optimization Problems. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, USA, 1987.
12. S. A. Kripke. Semantical considerations on modal logic. Ada Philosophica Fennica, 16:83-94, 1963.
13. F. Laroussinie, N. Markey, and G. Oreiby. Model checking timed ATL for durational concurrent game structures. In Proc. 4th Intl Conf. Formal Modelling and Analysis of Timed Systems (FORMATS'06), LNCS 4202, p. 245-259. Springer, Sept. 2006.
14. F. Laroussinie, N. Markey, and G. Oreiby. On the expressiveness and complexity of ATL. In Proc. 10th Intl Conf. Foundations of Software Science and Computation Structures (FoSSaCS'07), LNCS 4423, p. 243-257. Springer, Mar. 2007.
15. W. S. McCulloch and W. Pitts. A logical calculus of the ideas immanent in nervous activity. Bull. Mathematical Biophysics, 5:115-133,1943.
16. K. L. McMillan. Symbolic Model Checking --- An Approach to the State Explosion Problem. PhD thesis, CMU, 1993.
17. M. J. Osborne and A. Rubinstein. A course in game theory. MIT Press, 1994.
18. Ch. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
19. Ch. H. Papadimitriou and M. Yannakakis. The complexity of facets (and some facets of complexity). In Proceedings of the 14th Annual ACM Symposium on the Theory of Computing (STOC'82), p. 255-260. ACM Press, May 1982.
20. A. Pnueli. The temporal logic of programs. In Proc. 18th Ann. Symp. Foundations of Computer Science (FOCS'77), p. 46-57. IEEE Comp. Soc. Press, 1977.
21. J.-P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In M. Dezani-Ciancaglini and U. Montanari, editors, Proc. 5th Intl Symp. Programming (SOP'82), LNCS 137, p. 337-351. Springer, Apr. 1982.
22. P. J. Ramadge and W. M. Wonham. The control of discrete event systems. Proc. of the IEEE, 77(l):81-98, Jan. 1989.
23. T. Sandholm and V. R. Lesser. Coalitions among computationally bounded agents. Artificial Intelligence, 94(l-2):99-137, 1997.
24. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1): 1-22, 1976.
25. M. Wooldridge and P. E. Dunne. On the computational complexity of qualitative coalition games. Artificial Intelligence, 158(l):27-73, Sept. 2004.