BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach

Norihiro Kamide

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

BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach

Topics: Knowledge Representation and Reasoning; Model-Based Reasoning

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

Author: Norihiro Kamide

Affiliation: Waseda Institute for Advanced Study, Japan

Keyword(s): Temporal reasoning, Branching-time formalism, Linear-time formalism, Computation tree logic, Linear-time temporal logic, Model checking.

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

Abstract: A new temporal logic called linear-time computation tree logic (LCTL) is obtained from computation tree logic (CTL) by adding some modified versions of the temporal operators of linear-time temporal logic (LTL). A theorem for embedding LCTL into CTL is proved. The model-checking, validity and satisfiability problems of LCTL are shown to be deterministic PTIME-complete, EXPTIME-complete and deterministic EXPTIMEcomplete, respectively.

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 3.144.232.160

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. (2010). BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach. 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 522-526. DOI: 10.5220/0002709205220526

@conference{icaart10,
author={Norihiro Kamide.},
title={BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2010},
pages={522-526},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002709205220526},
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 - BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach
SN - 978-989-674-021-4
IS - 2184-433X
AU - Kamide, N.
PY - 2010
SP - 522
EP - 526
DO - 10.5220/0002709205220526
PB - SciTePress