PARACONSISTENT NEGATION AND CLASSICAL NEGATION IN COMPUTATION TREE LOGIC

Norihiro Kamide, Ken Kaneiwa

2010

Abstract

A paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree logic CTL. PCTL can be used to appropriately formalize inconsistency-tolerant temporal reasoning. A theorem for embedding PCTL into CTL is proved. The validity, satisfiability, and model-checking problems of PCTL are shown to be decidable. The embedding and decidability results indicate that we can reuse the existing CTL-based algorithms for validity, satisfiability and model-checking. An illustrative example of medical reasoning involving the use of PCTL is presented.

Paper Citation

in Harvard Style

Kamide N. and Kaneiwa K. (2010). PARACONSISTENT NEGATION AND CLASSICAL NEGATION IN COMPUTATION TREE LOGIC . In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-674-021-4, pages 464-469. DOI: 10.5220/0002699504640469

in Bibtex Style

@conference{icaart10,
author={Norihiro Kamide and Ken Kaneiwa},
title={PARACONSISTENT NEGATION AND CLASSICAL NEGATION IN COMPUTATION TREE LOGIC},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2010},
pages={464-469},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002699504640469},
isbn={978-989-674-021-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - PARACONSISTENT NEGATION AND CLASSICAL NEGATION IN COMPUTATION TREE LOGIC
SN - 978-989-674-021-4
AU - Kamide N.
AU - Kaneiwa K.
PY - 2010
SP - 464
EP - 469
DO - 10.5220/0002699504640469