Welcome to the InfoSci Platform
A Geometric Dynamic Temporal Reasoning Method with Tags for Cognitive Systems

A Geometric Dynamic Temporal Reasoning Method with Tags for Cognitive Systems

Rui Xu, Zhaoyu Li, Pingyuan Cui, Shengying Zhu, Ai Gao
Copyright: © 2016 |Volume: 8 |Issue: 4 |Pages: 17
ISSN: 1942-9045|EISSN: 1942-9037|EISBN13: 9781466690714|DOI: 10.4018/IJSSCI.2016100103
Cite Article Cite Article

MLA

Xu, Rui, et al. "A Geometric Dynamic Temporal Reasoning Method with Tags for Cognitive Systems." IJSSCI vol.8, no.4 2016: pp.43-59. http://doi.org/10.4018/IJSSCI.2016100103

APA

Xu, R., Li, Z., Cui, P., Zhu, S., & Gao, A. (2016). A Geometric Dynamic Temporal Reasoning Method with Tags for Cognitive Systems. International Journal of Software Science and Computational Intelligence (IJSSCI), 8(4), 43-59. http://doi.org/10.4018/IJSSCI.2016100103

Chicago

Xu, Rui, et al. "A Geometric Dynamic Temporal Reasoning Method with Tags for Cognitive Systems," International Journal of Software Science and Computational Intelligence (IJSSCI) 8, no.4: 43-59. http://doi.org/10.4018/IJSSCI.2016100103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Temporal reasoning is one of the cognitive capabilities humans involve in communicating with others and everything appears related because of temporal reference. Therefore, in this paper a geometric dynamic temporal reasoning algorithm is proposed to solve the temporal reasoning problem, especially in autonomous planning and scheduling. This method is based on the representation of actions in a two dimensional coordination system. The main advantage of this method over others is that it uses tags to mark new constraints added into the constraint network, which leads the algorithm to deal with pending constraints rather than all constraints. This characteristic makes the algorithm suitable for temporal reasoning, where variables and constraints are always added dynamically. This algorithm can be used not only in intelligent planning, but also computational intelligence, real-time systems, and etc. The results show the efficiency of our algorithm from four cases simulating the planning and scheduling process.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.