Constraint-based qualitative simulation

被引:7
作者
Apt, KR [1 ]
Brand, S [1 ]
机构
[1] Natl Univ Singapore, Singapore 117548, Singapore
来源
12TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS | 2005年
关键词
D O I
10.1109/TIME.2005.19
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider qualitative simulation involving a finite set of qualitative relations in presence of complete knowledge about their interrelationship. We show how it can be naturally captured by means of constraints expressed in temporal logic and constraint satisfaction problems. The constraints relate at each stage the 'past' of a simulation with its 'future'. The benefit of this approach is that it readily leads to an implementation based on constraint technology that can be used to generate simulations and to answer queries about them.
引用
收藏
页码:26 / 34
页数:9
相关论文
共 22 条
[1]   MAINTAINING KNOWLEDGE ABOUT TEMPORAL INTERVALS [J].
ALLEN, JF .
COMMUNICATIONS OF THE ACM, 1983, 26 (11) :832-843
[2]  
BACCHUS F, 2000, ARTIF INTELL, P116
[3]  
BANDELJ A, 2002, P 16 INT WORKSH QUAL
[4]   Focusing qualitative simulation using temporal logic: theoretical foundations [J].
Brajnik, G ;
Clancy, DJ .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1998, 22 (1-2) :59-86
[5]  
Brand S, 2004, LECT NOTES COMPUT SC, V3238, P337
[6]  
BRAND S, 2001, P 6 WORKSH ERCIM WOR
[7]  
Bratko I., 2001, INT COMPUTER SCI SER
[8]  
Cohn AG, 2001, FUND INFORM, V46, P1
[9]  
CUI Z, 1992, AAAI-92 PROCEEDINGS : TENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, P679
[10]  
EGENHOFER MJ, 1991, LECT NOTES COMPUT SC, V525, P144