PARACONSISTENT NEGATION AND CLASSICAL NEGATION IN COMPUTATION TREE LOGIC

Norihiro Kamide; Ken Kaneiwa

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

PARACONSISTENT NEGATION AND CLASSICAL NEGATION IN COMPUTATION TREE LOGIC

Topics: Knowledge Representation and Reasoning; Model-Based Reasoning; Uncertainty in AI

In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, 464-469, 2010 , Valencia, Spain

Authors: Norihiro Kamide ¹ and Ken Kaneiwa ²

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

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

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

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

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; ISSN 2184-433X, SciTePress, 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},
issn={2184-433X},
}

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
IS - 2184-433X
AU - Kamide, N.
AU - Kaneiwa, K.
PY - 2010
SP - 464
EP - 469
DO - 10.5220/0002699504640469
PB - SciTePress