loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Norihiro Kamide 1 and Ken Kaneiwa 2

Affiliations: 1 Waseda Institute for Advanced Study, Japan ; 2 National Institute of Information and Communications Technology, Japan

ISBN: 978-989-674-021-4

ISSN: 2184-433X

Keyword(s): Computation tree logic, Paraconsistent logic, Decidability, Medical reasoning.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Knowledge Representation and Reasoning ; Model-Based Reasoning ; Symbolic Systems ; Uncertainty in AI

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.239.51.78

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.