{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:45ZO4JJZHKNVGNKW45JPUF6HNL","short_pith_number":"pith:45ZO4JJZ","schema_version":"1.0","canonical_sha256":"e772ee25393a9b533556e752fa17c76ac11a0125eb2b80aede9cf09422d63c8f","source":{"kind":"arxiv","id":"0804.2435","version":3},"attestation_state":"computed","paper":{"title":"On the Expressiveness and Complexity of ATL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.LO","authors_text":"Francois Laroussinie, Ghassan Oreiby, Nicolas Markey","submitted_at":"2008-04-15T17:18:46Z","abstract_excerpt":"ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. In this paper, we first precisely characterize the complexity of ATL model-checking over Alternating Transition Systems and Concurrent Game Structures when the number of agents is not fixed. We prove that it is \\Delta^P_2 - and \\Delta^P_?_3-complete, depending on the underlying multi-agent model (ATS and CGS resp.). We also consider the same problems for some extensions "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0804.2435","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-04-15T17:18:46Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"8a019d9df60a78bb4f056123c2ebb7bd3e822e648a4886213963e332a34bb427","abstract_canon_sha256":"8dd7ca9a4f51674edebfb58527f51b06b8ae4992a2098b0a4b893e2c88eb9e4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:42.492015Z","signature_b64":"gFVVqfrzf49LvSiHV59ErrLAjLEagK7YS6ialGd429JednLo5ELApZYZifWhMT4UNH2dzlU4mEMVZdXLOWmAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e772ee25393a9b533556e752fa17c76ac11a0125eb2b80aede9cf09422d63c8f","last_reissued_at":"2026-05-18T01:37:42.491392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:42.491392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Expressiveness and Complexity of ATL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.LO","authors_text":"Francois Laroussinie, Ghassan Oreiby, Nicolas Markey","submitted_at":"2008-04-15T17:18:46Z","abstract_excerpt":"ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. In this paper, we first precisely characterize the complexity of ATL model-checking over Alternating Transition Systems and Concurrent Game Structures when the number of agents is not fixed. We prove that it is \\Delta^P_2 - and \\Delta^P_?_3-complete, depending on the underlying multi-agent model (ATS and CGS resp.). We also consider the same problems for some extensions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.2435","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"0804.2435","created_at":"2026-05-18T01:37:42.491479+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.2435v3","created_at":"2026-05-18T01:37:42.491479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.2435","created_at":"2026-05-18T01:37:42.491479+00:00"},{"alias_kind":"pith_short_12","alias_value":"45ZO4JJZHKNV","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"45ZO4JJZHKNVGNKW","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"45ZO4JJZ","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL","json":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL.json","graph_json":"https://pith.science/api/pith-number/45ZO4JJZHKNVGNKW45JPUF6HNL/graph.json","events_json":"https://pith.science/api/pith-number/45ZO4JJZHKNVGNKW45JPUF6HNL/events.json","paper":"https://pith.science/paper/45ZO4JJZ"},"agent_actions":{"view_html":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL","download_json":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL.json","view_paper":"https://pith.science/paper/45ZO4JJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.2435&json=true","fetch_graph":"https://pith.science/api/pith-number/45ZO4JJZHKNVGNKW45JPUF6HNL/graph.json","fetch_events":"https://pith.science/api/pith-number/45ZO4JJZHKNVGNKW45JPUF6HNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL/action/storage_attestation","attest_author":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL/action/author_attestation","sign_citation":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL/action/citation_signature","submit_replication":"https://pith.science/pith/45ZO4JJZHKNVGNKW45JPUF6HNL/action/replication_record"}},"created_at":"2026-05-18T01:37:42.491479+00:00","updated_at":"2026-05-18T01:37:42.491479+00:00"}