Name
Abstract | ||
|---|---|---|
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfiability problem and algorithms for deciding it. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/TIME.2008.10 | TIME |
Keywords | Field | DocType |
satisfiability problem,standard temporal logic,good friends,temporal description logic,computational complexity,open systems,game theory,automatic control,formal verification,encoding,control systems,logic,security,temporal logic,formal logic,mathematical model,automata | Computer science,Theoretical computer science,Game theory,Artificial intelligence,Function problem,Temporal logic,Multiplayer game,Computational complexity theory,Encoding (memory),Formal verification | Conference |
Citations | PageRank | References |
0 | 0.34 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Brihaye | 1 | 460 | 35.91 |
| Mohamed Ghannem | 2 | 0 | 0.34 |
| Nicolas Markey | 3 | 942 | 59.47 |
| Lionel Rieg | 4 | 45 | 6.91 |