ElGolog: A High-Level Programming Language with Memory of the Execution History

被引：0

作者：

De Giacomo, Giuseppe ^{[1
]}

Lesperance, Yves ^{[2
]}

Ternovska, Eugenia ^{[3
]}

机构：

[1] Sapienza Univ Roma, Rome, Italy

[2] York Univ, Toronto, ON, Canada

[3] Simon Fraser Univ, Burnaby, BC, Canada

来源：

THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2020年 / 34卷

基金：

欧洲研究理事会;

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Most programming languages only support tests that refer exclusively to the current state. This applies even to high-level programming languages based on the situation calculus such as Golog. The result is that additional variables/fluents/data structures must be introduced to track conditions that the program uses in tests to make decisions. In this paper, drawing inspiration from McCarthy's Elephant 2000, we propose an extended version of Golog, called ElGolog, that supports rich tests about the execution history, where tests are expressed in a first-order variant of two-way linear dynamic logic that uses ElGolog programs with converse. We show that in spite of rich tests, ElGolog shares key features with Golog, including a sematics based on macroexpansion into situation calculus formulas, upon which regression can still be applied. We also show that like Golog, our extended language can easily be implemented in Prolog.

引用

页码：2806 / 2813

页数：8

共 19 条

[1]

[Anonymous], 2000, FOUNDAT COMPUT

[2]

Baral C., 1996, P 3 S LOG FORM COMM

[3]

Bordini R. H., 2007, Programming multiagent systems in AgentSpeak using Jason

[4]

Brafman Ronen I., 2019, International Joint Conference on Artificial Intelligence, P1602, DOI [DOI 10.24963/IJCAI.2019/222, 10.24963/ijcai.2019/222]