Combining Paraconsistency and Probability in CTL

Norihiro Kamide; Daiki Koizumi

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

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

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

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

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

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

Name:
Country:
Subject:

Advanced Search Affiliations Search

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

Proceedings

Proceedings Search

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

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

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

Combining Paraconsistency and Probability in CTL

Topics: Knowledge Representation and Reasoning; Uncertainty in AI

In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, 285-293, 2015 , Lisbon, Portugal

Authors: Norihiro Kamide ¹ and Daiki Koizumi ²

Affiliations: ¹ Teikyo University, Japan ; ² Aoyama Gakuin University, Japan

Keyword(s): Computation Tree Logic, Paraconsistent Reasoning, Probabilistic Reasoning, Model Checking.

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

Abstract: Computation tree logic (CTL) is known to be one of the most useful temporal logics for verifying concurrent systems by model checking technologies. However, CTL is not sufficient for handling inconsistency-tolerant and probabilistic accounts of concurrent systems. In this paper, a paraconsistent (or inconsistency-tolerant) probabilistic computation tree logic (PpCTL) is derived from an existing probabilistic computation tree logic (pCTL) by adding a paraconsistent negation connective. A theorem for embedding PpCTL into pCTL is proven, which indicates that we can reuse existing pCTL-based model checking algorithms. Some illustrative examples involving the use of PpCTL are also 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.219.112.111

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 Koizumi, D. (2015). Combining Paraconsistency and Probability in CTL. In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-074-1; ISSN 2184-433X, SciTePress, pages 285-293. DOI: 10.5220/0005180402850293

@conference{icaart15,
author={Norihiro Kamide. and Daiki Koizumi.},
title={Combining Paraconsistency and Probability in CTL},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2015},
pages={285-293},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005180402850293},
isbn={978-989-758-074-1},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Combining Paraconsistency and Probability in CTL
SN - 978-989-758-074-1
IS - 2184-433X
AU - Kamide, N.
AU - Koizumi, D.
PY - 2015
SP - 285
EP - 293
DO - 10.5220/0005180402850293
PB - SciTePress