REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL

Norihiro Kamide

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

REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL

Topics: Knowledge Representation and Reasoning; Model-Based Reasoning

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

Author: Norihiro Kamide

Affiliation: Waseda Institute for Advanced Study, Japan

Keyword(s): Temporal reasoning, Bounded time domain, Linear-time temporal logic, Satisfiability, NP-completeness.

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

Abstract: It is known that linear-time temporal logic (LTL) is one of the most useful logics for reasoning about time and for verifying concurrent systems. It is also known that the satisfiability problem for LTL is PSPACE-complete and that finding NP-complete fragments of LTL is an important issue for constructing efficiently executable temporal logics. In this paper, an alternative NP-complete logic called bounded linear-time temporal logic is obtained from LTL by restricting the time domain of temporal operators.

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.226.93.209

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). REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL. 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 536-539. DOI: 10.5220/0002714805360539

@conference{icaart10,
author={Norihiro Kamide.},
title={REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2010},
pages={536-539},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002714805360539},
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 - REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL
SN - 978-989-674-021-4
IS - 2184-433X
AU - Kamide, N.
PY - 2010
SP - 536
EP - 539
DO - 10.5220/0002714805360539
PB - SciTePress