(De)composition of situation calculus theories

被引:0
|
作者
Amir, E [1 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We show that designing large situation calculus theories can be simplified by using object-oriented techniques and tools together with established solutions to the frame problem. Situation calculus (McCarthy & Hayes 1969) is one of the leading logical representations for action and change, but large situation calculus theories are not easy to design and maintain, nor are they flexible for extension or reuse. However, we wish to use it to represent large, complex domains. To address this problem, we apply our proposed methodology to situation calculus theories and analyze the composition of theories in this light. The object-oriented tools that we use do not change the semantics of situation calculus, so all the original situation calculus results apply in our setting and vice versa. We get two additional results from this approach. First, we offer a new treatment of loosely interacting agents that uses situation calculus without abandoning the result formalism. This treatment allows a theory-builder to construct a theory without considering its potential inclusion in a multiple-agents setup. Second, theories that we build in this way admit specialized reasoning algorithms.
引用
收藏
页码:456 / 463
页数:8
相关论文
共 50 条
  • [1] Theories of intentions in the framework of situation calculus
    Parra, PP
    Nayak, A
    Demolombe, R
    DECLARATIVE AGENT LANGUAGES AND TECHNOLOGIES II, 2005, 3476 : 19 - 34
  • [2] Bounded situation calculus action theories
    De Giacomo, Giuseppe
    Lesperance, Yves
    Patrizi, Fabio
    ARTIFICIAL INTELLIGENCE, 2016, 237 : 172 - 203
  • [3] Abstraction in Situation Calculus Action Theories
    Banihashemi, Bita
    De Giacomo, Giuseppe
    Lesperance, Yves
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1048 - 1055
  • [4] Abstraction of Nondeterministic Situation Calculus Action Theories
    Banihashemi, Bita
    De Giacomo, Giuseppe
    Lesperance, Yves
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 3112 - 3122
  • [5] On the Progression of Situation Calculus Universal Theories with Constants
    Arenas, Marcelo
    Baier, Jorge A.
    Navarro, Juan S.
    Sardina, Sebastian
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 484 - 493
  • [6] On First-Order μ-Calculus over Situation Calculus Action Theories
    Calvanese, Diego
    De Giacomo, Giuseppe
    Montali, Marco
    Patrizi, Fabio
    FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2016, : 411 - 420
  • [7] Transforming Situation Calculus Action Theories for Optimised Reasoning
    Ewin, Christopher
    Pearce, Adrian R.
    Vassos, Stavros
    FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 448 - 457
  • [8] Progression of Situation Calculus Action Theories with Incomplete Information
    Vassos, Stavros
    Levesque, Hector
    20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 2029 - 2034
  • [9] Verifying ConGolog Programs on Bounded Situation Calculus Theories
    De Giacomo, Giuseppe
    Lesperance, Yves
    Patrizi, Fabio
    Sardina, Sebastian
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 950 - 956
  • [10] Representing actions in logic programs and default theories - A situation calculus approach
    Turner, H
    JOURNAL OF LOGIC PROGRAMMING, 1997, 31 (1-3): : 245 - 298