Goal specification in presence of non-deterministic Actions

Chitta Baral, Jicheng Zhao

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

7 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. For agents whose actions have deterministic consequences various goal specification languages have been proposed. The situation is different, and less studied, when the actions may have non-deterministic consequences. For example, a simple goal of achieving p has many nuances such as making sure that p is achieved, trying ones best to achieve p, preferring guaranteed achievement of p over possible achievement, and so on. Similarly, there are many nuances in expressing the goal to try to achieve p, and if it fails then to achieve q. We develop an extension of the branching time temporal logic CTL, which we call π-CTL, and show how the above mentioned goals can be expressed using it, and why they can not be expressed in CTL. We compare our approach to an alternative approach proposed in the literature.

Original languageEnglish (US)
Title of host publicationECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings
PublisherIOS Press
Pages273-277
Number of pages5
Volume110
ISBN (Electronic)9781586034528
StatePublished - 2004
Event16th European Conference on Artificial Intelligence, ECAI 2004 - Valencia, Spain
Duration: Aug 22 2004Aug 27 2004

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume110
ISSN (Print)09226389

Other

Other16th European Conference on Artificial Intelligence, ECAI 2004
CountrySpain
CityValencia
Period8/22/048/27/04

Fingerprint

Specifications
Temporal logic
Specification languages
Robots

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Baral, C., & Zhao, J. (2004). Goal specification in presence of non-deterministic Actions. In ECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings (Vol. 110, pp. 273-277). (Frontiers in Artificial Intelligence and Applications; Vol. 110). IOS Press.

Goal specification in presence of non-deterministic Actions. / Baral, Chitta; Zhao, Jicheng.

ECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings. Vol. 110 IOS Press, 2004. p. 273-277 (Frontiers in Artificial Intelligence and Applications; Vol. 110).

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

Baral, C & Zhao, J 2004, Goal specification in presence of non-deterministic Actions. in ECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings. vol. 110, Frontiers in Artificial Intelligence and Applications, vol. 110, IOS Press, pp. 273-277, 16th European Conference on Artificial Intelligence, ECAI 2004, Valencia, Spain, 8/22/04.
Baral C, Zhao J. Goal specification in presence of non-deterministic Actions. In ECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings. Vol. 110. IOS Press. 2004. p. 273-277. (Frontiers in Artificial Intelligence and Applications).
Baral, Chitta ; Zhao, Jicheng. / Goal specification in presence of non-deterministic Actions. ECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings. Vol. 110 IOS Press, 2004. pp. 273-277 (Frontiers in Artificial Intelligence and Applications).
@inproceedings{7791c7e790384283906ff602fd1a06a8,
title = "Goal specification in presence of non-deterministic Actions",
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. For agents whose actions have deterministic consequences various goal specification languages have been proposed. The situation is different, and less studied, when the actions may have non-deterministic consequences. For example, a simple goal of achieving p has many nuances such as making sure that p is achieved, trying ones best to achieve p, preferring guaranteed achievement of p over possible achievement, and so on. Similarly, there are many nuances in expressing the goal to try to achieve p, and if it fails then to achieve q. We develop an extension of the branching time temporal logic CTL, which we call π-CTL, and show how the above mentioned goals can be expressed using it, and why they can not be expressed in CTL. We compare our approach to an alternative approach proposed in the literature.",
author = "Chitta Baral and Jicheng Zhao",
year = "2004",
language = "English (US)",
volume = "110",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
pages = "273--277",
booktitle = "ECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings",
address = "Netherlands",

}

TY - GEN

T1 - Goal specification in presence of non-deterministic Actions

AU - Baral, Chitta

AU - Zhao, Jicheng

PY - 2004

Y1 - 2004

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. For agents whose actions have deterministic consequences various goal specification languages have been proposed. The situation is different, and less studied, when the actions may have non-deterministic consequences. For example, a simple goal of achieving p has many nuances such as making sure that p is achieved, trying ones best to achieve p, preferring guaranteed achievement of p over possible achievement, and so on. Similarly, there are many nuances in expressing the goal to try to achieve p, and if it fails then to achieve q. We develop an extension of the branching time temporal logic CTL, which we call π-CTL, and show how the above mentioned goals can be expressed using it, and why they can not be expressed in CTL. We compare our approach to an alternative approach proposed in the literature.

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. For agents whose actions have deterministic consequences various goal specification languages have been proposed. The situation is different, and less studied, when the actions may have non-deterministic consequences. For example, a simple goal of achieving p has many nuances such as making sure that p is achieved, trying ones best to achieve p, preferring guaranteed achievement of p over possible achievement, and so on. Similarly, there are many nuances in expressing the goal to try to achieve p, and if it fails then to achieve q. We develop an extension of the branching time temporal logic CTL, which we call π-CTL, and show how the above mentioned goals can be expressed using it, and why they can not be expressed in CTL. We compare our approach to an alternative approach proposed in the literature.

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

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

M3 - Conference contribution

AN - SCOPUS:85017401155

VL - 110

T3 - Frontiers in Artificial Intelligence and Applications

SP - 273

EP - 277

BT - ECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings

PB - IOS Press

ER -