A sound and complete reified temporal logic
Zhao, Guoxing, Ma, Jixin, Shen, Fuxing and Petridis, Miltos (2008) A sound and complete reified temporal logic. In: Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. IEEE Conference Publications . Institute of Electrical and Electronics Engineers, Inc., Piscataway, NJ, USA, pp. 111-116. ISBN 978-0-7695-3263-9 (doi:10.1109/SNPD.2008.16)Full text not available from this repository.
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.
|Item Type:||Conference Proceedings|
|Title of Proceedings:||Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08.|
|Additional Information:|| This paper was first presented at the Proceedings of the Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD '08), held in conjunction with the Second International Workshop on Advance Internet Technology and Applications, from 6-8 August 2008 in Phuket, Thailand.  First published online: 03 September 2008|
|Uncontrolled Keywords:||completeness, reified temporal logic|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Pre-2014 Departments:||School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Computer & Computational Science Research Group
School of Computing & Mathematical Sciences > Department of Computer Science
School of Computing & Mathematical Sciences > Department of Computer Systems Technology
|Last Modified:||14 Oct 2016 09:03|
Actions (login required)