Abstract— In this paper, a new extended linear-time temporal logic (LTL), called sequential paraconsistent LTL (SPLTL), is introduced for formalizing inconsistency-tolerant reasoning with hierarchical information. A theorem for embedding SPLTL into LTL is proved, and SPLTL is shown to be decidable. Some illustrative examples for verifying Students' learning processes are presented using SPLTL.

Index Terms— Decidability, linear-time temporal logic, paraconsistent logic, students’ learning processes.

Norihiro Kamide is with Faculty of Information Technology and Business, Cyber University, Japan Cyber Educational Institute, Ltd. Izumishibakouen Building 4F, 1-6-8 Shibakouen, Minato-ku, Tokyo 105-0011, Japan (e-mail: drnkamide08@kpd.biglobe.ne.jp).

Cite: Norihiro Kamide, " An Extended LTL for Inconsistency-Tolerant Reasoning with Hierarchical Information: Verifying Students' Learning Processes," International Journal of e-Education, e-Business, e-Management and e-Learning vol. 3, no. 3, pp. 234-238, 2013.