Publicação:
On some aspects of decidability of annotated systems

Página do item simplificado
dc.contributor.authorAbe, J. M.
dc.contributor.authorAkama, S.
dc.contributor.authorArabnia, H. R.
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2020-12-10T16:30:17Z
dc.date.available2020-12-10T16:30:17Z
dc.date.issued2001-01-01
dc.description.abstractIn 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.en
dc.description.affiliationUniv Estadual Paulista, ICET, Dept Informat, BR-04026002 Sao Paulo, SP, Brazil
dc.description.affiliationUnespUniv Estadual Paulista, ICET, Dept Informat, BR-04026002 Sao Paulo, SP, Brazil
dc.format.extent789-795
dc.identifier.citationIc-ai'2001: Proceedings Of The International Conference On Artificial Intelligence, Vols I-iii. Athens: C S R E A Press, p. 789-795, 2001.
dc.identifier.urihttp://hdl.handle.net/11449/194567
dc.identifier.wosWOS:000173960400125
dc.language.isoeng
dc.publisherC S R E A Press
dc.relation.ispartofIc-ai'2001: Proceedings Of The International Conference On Artificial Intelligence, Vols I-iii
dc.sourceWeb of Science
dc.subjectannotated logics
dc.subjectparaconsistent logics
dc.subjectdecidabitity
dc.titleOn some aspects of decidability of annotated systemsen
dc.typeTrabalho apresentado em evento
dcterms.rightsHolderC S R E A Press
dspace.entity.typePublication

Arquivos

Coleções

Artigos