Actas de congresos
On some aspects of decidability of annotated systems
Fecha
2001-01-01Registro en:
Ic-ai'2001: Proceedings Of The International Conference On Artificial Intelligence, Vols I-iii. Athens: C S R E A Press, p. 789-795, 2001.
WOS:000173960400125
Autor
Universidade Estadual Paulista (Unesp)
Institución
Resumen
In this paper, we discuss some results of decidability of annotated systems. The annotated propositional logic Ptau and its S5 type modal extension S5tau are shown to be decidable. These results reveal that annotated systems are computationally attractive as the foundations of paraconsistent reasoning.