Extending ConGolog to allow partial ordering

Chitta Baral; Tran Cao Son

Extending ConGolog to allow partial ordering

Chitta Baral, Tran Cao Son

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Scopus citations

Abstract

In this paper we extend the high level execution language ConGolog (developed at the University of Toronto) by adding to it a new construct which we call the htn-construct. The new construct improves ConGolog by allowing easy specification of non-determinism when a partial ordering between a set of actions needs to be maintained. Furthermore, it allows temporal constraints to be specified easily. We present an implementation of the htn-construct in PROLOG which can be directly added to PROLOG implementations of ConGolog interpreters.

Original language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Pages	188-204
Number of pages	17
Volume	1757
ISBN (Print)	3540672001, 9783540672005
State	Published - 2000
Event	6th International Workshop on Agent Theories Architectures and Languages, ATAL 1999 - Orlando, United States Duration: Jul 15 1999 → Jul 17 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1757
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	6th International Workshop on Agent Theories Architectures and Languages, ATAL 1999
Country/Territory	United States
City	Orlando
Period	7/15/99 → 7/17/99

ASJC Scopus subject areas

Computer Science(all)
Theoretical Computer Science

Cite this

Baral, C., & Son, T. C. (2000). Extending ConGolog to allow partial ordering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1757, pp. 188-204). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1757). Springer Verlag.

Extending ConGolog to allow partial ordering. / Baral, Chitta; Son, Tran Cao.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1757 Springer Verlag, 2000. p. 188-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1757).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Baral, C & Son, TC 2000, Extending ConGolog to allow partial ordering. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1757, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1757, Springer Verlag, pp. 188-204, 6th International Workshop on Agent Theories Architectures and Languages, ATAL 1999, Orlando, United States, 7/15/99.

Baral C, Son TC. Extending ConGolog to allow partial ordering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1757. Springer Verlag. 2000. p. 188-204. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Baral, Chitta ; Son, Tran Cao. / Extending ConGolog to allow partial ordering. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1757 Springer Verlag, 2000. pp. 188-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{31f59ac9c0284a8e8cb4c6ec231524c6,

title = "Extending ConGolog to allow partial ordering",

abstract = "In this paper we extend the high level execution language ConGolog (developed at the University of Toronto) by adding to it a new construct which we call the htn-construct. The new construct improves ConGolog by allowing easy specification of non-determinism when a partial ordering between a set of actions needs to be maintained. Furthermore, it allows temporal constraints to be specified easily. We present an implementation of the htn-construct in PROLOG which can be directly added to PROLOG implementations of ConGolog interpreters.",

author = "Chitta Baral and Son, {Tran Cao}",

year = "2000",

language = "English (US)",

isbn = "3540672001",

volume = "1757",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "188--204",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

note = "6th International Workshop on Agent Theories Architectures and Languages, ATAL 1999 ; Conference date: 15-07-1999 Through 17-07-1999",

}

TY - GEN

T1 - Extending ConGolog to allow partial ordering

AU - Baral, Chitta

AU - Son, Tran Cao

PY - 2000

Y1 - 2000

N2 - In this paper we extend the high level execution language ConGolog (developed at the University of Toronto) by adding to it a new construct which we call the htn-construct. The new construct improves ConGolog by allowing easy specification of non-determinism when a partial ordering between a set of actions needs to be maintained. Furthermore, it allows temporal constraints to be specified easily. We present an implementation of the htn-construct in PROLOG which can be directly added to PROLOG implementations of ConGolog interpreters.

AB - In this paper we extend the high level execution language ConGolog (developed at the University of Toronto) by adding to it a new construct which we call the htn-construct. The new construct improves ConGolog by allowing easy specification of non-determinism when a partial ordering between a set of actions needs to be maintained. Furthermore, it allows temporal constraints to be specified easily. We present an implementation of the htn-construct in PROLOG which can be directly added to PROLOG implementations of ConGolog interpreters.

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

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

M3 - Conference contribution

AN - SCOPUS:84942942763

SN - 3540672001

SN - 9783540672005

VL - 1757

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 188

EP - 204

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

T2 - 6th International Workshop on Agent Theories Architectures and Languages, ATAL 1999

Y2 - 15 July 1999 through 17 July 1999

ER -

Extending ConGolog to allow partial ordering

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this