Name
Abstract | ||
|---|---|---|
There are mainly two known approaches to the representation of temporal information in Computer Science: modal logic approaches (including tense logics and hybrid temporal logics) and predicate logic approaches (including temporal argument methods and reified temporal logics). On one hand, while tense logics, hybrid temporal logics and temporal argument methods enjoy formal theoretical foundations, their expressiveness has been criticised as not power enough for representing general temporal knowledge; on the other hand, although current reified temporal logics provide greater expressive power, most of them lack of complete and sound axiomatic theories. In this paper, we propose a new reified temporal logic with a clear syntax and semantics in terms of a sound and complete axiomatic formalism which retains all the expressive power of the approach of temporal reification. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/SNPD.2008.16 | SNPD |
Keywords | Field | DocType |
temporal reification,tense logics,new reified temporal logic,modal logic,tense logic,completeness,temporal argument method,temporal knowledge representation,expressive power,predicate logic,hybrid temporal logics,general temporal knowledge,temporal information,complete reified temporal logic,temporal argument methods,reified temporal logics,reified temporal logic,temporal logic,hybrid temporal logic,current reified temporal logic,terminology,computer science,cognition,lifting equipment | Computation tree logic,T-norm fuzzy logics,Temporal logic of actions,Interval temporal logic,Computer science,Theoretical computer science,Linear temporal logic,Modal logic,Temporal logic,Predicate logic | Conference |
ISBN | Citations | PageRank |
978-0-7695-3263-9 | 0 | 0.34 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guoxing Zhao | 1 | 16 | 3.43 |
| Ma Jixin | 2 | 206 | 32.69 |
| Fuxing Shen | 3 | 0 | 0.34 |
| Miltos Petridis | 4 | 165 | 31.65 |