| Reasoning in Medical and Tutoring Systems: A Decidable First-Order Temporal Paraconsistent Non-Commutative Logic |
| Download PDF |
| Norihiro Kamide. Reasoning in Medical and Tutoring Systems: A Decidable First-Order Temporal Paraconsistent Non-Commutative Logic. International Journal of Software and Informatics, 2015,9(1):73~92 |
| Hits: 2094 |
| Download times: 0 |
|
| Fund:This work is sponsored by Okawa Foundation for Information and Telecommunications, and JSPS Grant-in-Aid for Scientific Research (C) 26330263. |
|
| Abstract:Reasoning in medical and tutoring systems requires expressions relating not only to time-dependency, paraconsistency, constructiveness, and resource-sensitivity, but also order-sensitivity. Our objective in this study is to construct a decidable rst-order logic for appropriately expressing this reasoning. To meet this objective, we introduce a rst-order temporal paraconsistent non-commutative logic as a Gentzen-type sequent calculus. This logic has no structural rules but has some bounded temporal operators and a paraconsistent negation connective. The main result of this study is to show this logic to be decidable. Based on this logic, we present some illustrative examples for reasoning in medical and tutoring systems. |
| keywords:decidability rst-order logic temporal logic non-commutative logic paraconsistent logic medical reasoning intelligent tutoring system |
| View Full Text View/Add Comment Download reader |
