Goal specification, non-determinism and quantifying over policies

Chitta Baral, Jicheng Zhao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. Temporal logics such as LTL, and CTL* have been used to specify goals of cognitive robots and agents when their actions have deterministic consequences. It has been suggested that in domains where actions have non-deterministic effects, temporal logics may not be able to express many intuitive and useful goals. In this paper we first show that this is indeed true with respect to existing temporal logics such as LTL, CTL*, and π-CTL*. We then propose the language, P-CTL*, which includes the quantifiers, exist a policy and for all policies. We show that this language allows for the specification of richer goals, including many intuitive and useful goals mentioned in the literature which cannot be expressed in existing temporal languages. We generalize our approach of showing the limitations of Tr-CTL* to develop a framework to compare expressiveness of goal languages.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Pages231-237
Number of pages7
Volume1
StatePublished - 2006
Event21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 - Boston, MA, United States
Duration: Jul 16 2006Jul 20 2006

Other

Other21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06
CountryUnited States
CityBoston, MA
Period7/16/067/20/06

Fingerprint

Temporal logic
Specifications
Robots

ASJC Scopus subject areas

  • Software

Cite this

Baral, C., & Zhao, J. (2006). Goal specification, non-determinism and quantifying over policies. In Proceedings of the National Conference on Artificial Intelligence (Vol. 1, pp. 231-237)

Goal specification, non-determinism and quantifying over policies. / Baral, Chitta; Zhao, Jicheng.

Proceedings of the National Conference on Artificial Intelligence. Vol. 1 2006. p. 231-237.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Baral, C & Zhao, J 2006, Goal specification, non-determinism and quantifying over policies. in Proceedings of the National Conference on Artificial Intelligence. vol. 1, pp. 231-237, 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06, Boston, MA, United States, 7/16/06.
Baral C, Zhao J. Goal specification, non-determinism and quantifying over policies. In Proceedings of the National Conference on Artificial Intelligence. Vol. 1. 2006. p. 231-237
Baral, Chitta ; Zhao, Jicheng. / Goal specification, non-determinism and quantifying over policies. Proceedings of the National Conference on Artificial Intelligence. Vol. 1 2006. pp. 231-237
@inproceedings{daa5e0957a74412caf7b348a656325e9,
title = "Goal specification, non-determinism and quantifying over policies",
abstract = "One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. Temporal logics such as LTL, and CTL* have been used to specify goals of cognitive robots and agents when their actions have deterministic consequences. It has been suggested that in domains where actions have non-deterministic effects, temporal logics may not be able to express many intuitive and useful goals. In this paper we first show that this is indeed true with respect to existing temporal logics such as LTL, CTL*, and π-CTL*. We then propose the language, P-CTL*, which includes the quantifiers, exist a policy and for all policies. We show that this language allows for the specification of richer goals, including many intuitive and useful goals mentioned in the literature which cannot be expressed in existing temporal languages. We generalize our approach of showing the limitations of Tr-CTL* to develop a framework to compare expressiveness of goal languages.",
author = "Chitta Baral and Jicheng Zhao",
year = "2006",
language = "English (US)",
isbn = "1577352815",
volume = "1",
pages = "231--237",
booktitle = "Proceedings of the National Conference on Artificial Intelligence",

}

TY - GEN

T1 - Goal specification, non-determinism and quantifying over policies

AU - Baral, Chitta

AU - Zhao, Jicheng

PY - 2006

Y1 - 2006

N2 - One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. Temporal logics such as LTL, and CTL* have been used to specify goals of cognitive robots and agents when their actions have deterministic consequences. It has been suggested that in domains where actions have non-deterministic effects, temporal logics may not be able to express many intuitive and useful goals. In this paper we first show that this is indeed true with respect to existing temporal logics such as LTL, CTL*, and π-CTL*. We then propose the language, P-CTL*, which includes the quantifiers, exist a policy and for all policies. We show that this language allows for the specification of richer goals, including many intuitive and useful goals mentioned in the literature which cannot be expressed in existing temporal languages. We generalize our approach of showing the limitations of Tr-CTL* to develop a framework to compare expressiveness of goal languages.

AB - One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. Temporal logics such as LTL, and CTL* have been used to specify goals of cognitive robots and agents when their actions have deterministic consequences. It has been suggested that in domains where actions have non-deterministic effects, temporal logics may not be able to express many intuitive and useful goals. In this paper we first show that this is indeed true with respect to existing temporal logics such as LTL, CTL*, and π-CTL*. We then propose the language, P-CTL*, which includes the quantifiers, exist a policy and for all policies. We show that this language allows for the specification of richer goals, including many intuitive and useful goals mentioned in the literature which cannot be expressed in existing temporal languages. We generalize our approach of showing the limitations of Tr-CTL* to develop a framework to compare expressiveness of goal languages.

UR - http://www.scopus.com/inward/record.url?scp=33750684645&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750684645&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33750684645

SN - 1577352815

SN - 9781577352815

VL - 1

SP - 231

EP - 237

BT - Proceedings of the National Conference on Artificial Intelligence

ER -