Inductive situation calculus

被引:21
作者
Denecker, Marc [1 ]
Ternovska, Eugenia
机构
[1] Katholieke Univ Leuven, Dept Comp Sci, Louvain, Belgium
[2] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada
关键词
knowledge representation; inductive definitions; situation calculus;
D O I
10.1016/j.artint.2007.02.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation calculus in ED-logic, classical logic extended with inductive definitions. This logic has been proposed recently and is an extension of classical logic. It allows for a uniform representation of various forms of definitions, including monotone inductive definitions and non-monotone forms of inductive definitions such as iterated induction and induction over well-founded posets. We show that the role of such complex forms of definitions is not limited to mathematics but extends to commonsense knowledge representation. In the ID-logic axiomatization of the situation calculus, fluents and causality predicates are defined by simultaneous induction on the well-founded poset of situations. The inductive approach allows us to solve the ramification problem for the situation calculus in a uniform and modular way. Our solution is among the most general solutions for the ramification problem in the situation calculus. Using previously developed modularity techniques, we show that the basic variant of the inductive situation calculus without ramification rules is equivalent to Reiter-style situation calculus. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:332 / 360
页数:29
相关论文
共 42 条
[1]  
ACZEL P, 1977, HDB MATH LOGIC, P739
[2]  
[Anonymous], J METHODS LOGIC COMP
[3]  
[Anonymous], 1991, Artificial intelligence and mathematical theory of computation: papers in honor of John McCarthy, DOI DOI 10.1016/B978-0-12-450010-5.50026-8
[4]  
Baader F., 2002, DESCRIPTION LOGIC HD
[5]  
Clark K. L., 1978, Logic and data bases, P293
[6]   The well-founded semantics is the principle of inductive definition [J].
Denecker, M .
LOGICS IN ARTIFICIAL INTELLIGENCE, 1998, 1489 :1-16
[7]  
Denecker M, 2000, LECT NOTES ARTIF INT, V1861, P703
[8]  
DENECKER M, 2004, P 9 INT C PRINC KNOW, P545
[9]  
DENECKER M, 2007, ACM T COMPUTATIONAL
[10]  
Denecker M., 1998, LINKOPING ELECT ARTI, V3, P1