Transformations of logic programs related to causality and planning

被引：7

作者：

Erdem, E ^{[1
]}

Lifschitz, V ^{[1
]}

机构：

[1] Univ Texas, Dept Comp Sci, Austin, TX 78712 USA

来源：

LOGIC PROGRAMMING AND NONMONOTONIC REASONING | 1999年 / 1730卷

关键词：

D O I：

10.1007/3-540-46767-X_8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We prove two properties of logic programs under the answer set semantics that may be useful in connection with applications of logic programming to representing causality and to planning. One theorem is about the use of disjunctive rules to express that an atom is exogenous. The other provides an alternative way of expressing that a plan does not include concurrently executed actions.

引用

页码：107 / 116

页数：10

共 11 条

[1] Ben-Eliyahu R., 1994, Annals of Mathematics and Artificial Intelligence, V12, P53, DOI 10.1007/BF01530761
[2] EITER T, 1997, P 4 INT C LOG PROGR, P363
[3] GELFOND M, 1991, PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, P230
[4] Gelfond M., 1991, New Generation Computing, V9, P365, DOI 10.1007/BF03037169
[5] Kautz H, 1996, PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, P1194
[6] Lifschitz Vladimir, 1994, LOGIC PROGRAMMING, P23
[7] Lifschitz Vladimir., 1996, PRINCIPLES KNOWLEDGE, P69
[8] McCain N., 1997, THESIS U TEXAS AUSTI
[9] McCain N., 1997, Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Conference on Innovative Applications of Artificial Intelligence, P460, DOI DOI 10.1093/ACPROF:OSO/9780198235880.003.0005
[10] NIEMELA I, 1999, IN PRESS ANN MATH AR

← 1 2 →