A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic (Q2386107): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MOCHA / rank | |||
Normal rank | |||
Revision as of 04:07, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic |
scientific article |
Statements
A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic (English)
0 references
22 August 2005
0 references
temporal epistemic logic
0 references
verification of game-like structures
0 references
symbolic model checking
0 references
multi-agent systems
0 references
concurrent epistemic game structures
0 references
