On some aspects of decidability of annotated systems
Nenhuma Miniatura disponível
Data
2001-01-01
Autores
Abe, J. M.
Akama, S.
Arabnia, H. R.
Título da Revista
ISSN da Revista
Título de Volume
Editor
C S R E A Press
Resumo
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.
Descrição
Palavras-chave
annotated logics, paraconsistent logics, decidabitity
Como citar
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.