{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:22:34Z","timestamp":1777645354665,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-3","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p>Alternating-time Temporal Logic (ATL) is probably themost\n\t\t\t influential logic of strategic ability that has emerged in recent years. The\n\t\t\t idea of ATL is centered around cooperation modalities: \u226aA\u226b\u03b3 is\n\t\t\t satisfied if the group A of agents has a collective strategy to enforce\n\t\t\t temporal property \u03b3 against the worst possible response from the\n\t\t\t other agents. So, the semantics of ATL shares the\n\t\t\t \"all-or-nothing\" attitude of many logical approaches\n\t\t\t to computation.<\/jats:p>\n                  <jats:p>Such an assumption seems appropriate in some application areas\n\t\t\t (life-critical systems, security protocols, expensive ventures like space\n\t\t\t missions). In many cases, however, one might be satisfied if the goal is\n\t\t\t achieved with reasonable likelihood. In this paper, we try to soften the\n\t\t\t rigorous notion of success that underpins ATL.<\/jats:p>","DOI":"10.3233\/fi-2009-0089","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:42:04Z","timestamp":1575326524000},"page":"81-96","source":"Crossref","is-referenced-by-count":9,"title":["What Agents Can Probably Enforce"],"prefix":"10.1177","volume":"93","author":[{"given":"Nils","family":"Bulling","sequence":"first","affiliation":[{"name":"Department of Informatics, Clausthal University of\r\t\t\t Technology, Germany. {bulling,wjamroga}@in.tu-clausthal.de"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Jamroga","sequence":"additional","affiliation":[{"name":"Department of Informatics, Clausthal University of\r\t\t\t Technology, Germany. {bulling,wjamroga}@in.tu-clausthal.de"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2009,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0089","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:01Z","timestamp":1777444321000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-0089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.3233\/FI-2009-0089"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-0089","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}