In computer science, Alternating-time Temporal Logic, or ATL, is a branching-time temporal logic that naturally describes computations of multi-agent system and multiplayer games.. It offers selective quantification over program-paths that are possible outcomes of games . ATL uses alternating-time formulas to construct model-checkers in order to address problems such as receptiveness, realizability, and controllability.
| Property | Value |
|---|
| dbpprop:abstract
|
- In computer science, Alternating-time Temporal Logic, or ATL, is a branching-time temporal logic that naturally describes computations of multi-agent system and multiplayer games.. It offers selective quantification over program-paths that are possible outcomes of games . ATL uses alternating-time formulas to construct model-checkers in order to address problems such as receptiveness, realizability, and controllability.
|
| rdfs:comment
|
- In computer science, Alternating-time Temporal Logic, or ATL, is a branching-time temporal logic that naturally describes computations of multi-agent system and multiplayer games.. It offers selective quantification over program-paths that are possible outcomes of games . ATL uses alternating-time formulas to construct model-checkers in order to address problems such as receptiveness, realizability, and controllability.
|
| rdfs:label
|
- Alternating-time Temporal Logic
|
| skos:subject
| |
| foaf:page
| |
![[RDF Data]](/statics/sw-cube.png)
