Constraint deduction in an interval-based temporal logic

被引:0
作者
Koehler, J
Treinen, R
机构
来源
EXECUTABLE MODAL AND TEMPORAL LOGICS | 1995年 / 897卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We describe reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop. We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning system PHI which uses LLP as underlying formalism.
引用
收藏
页码:103 / 117
页数:15
相关论文
共 25 条
[1]   THE POWER OF TEMPORAL PROOFS [J].
ABADI, M .
THEORETICAL COMPUTER SCIENCE, 1989, 65 (01) :35-83
[2]  
BAUER M, 1992, LECT NOTES ARTIF INT, V607, P355
[3]  
BAUER M, 1993, P 13 INT JOINT C ART
[4]   A DEDUCTIVE SOLUTION FOR PLAN GENERATION [J].
BIBEL, W .
NEW GENERATION COMPUTING, 1986, 4 (02) :115-132
[5]  
BIUNDO S, 1992, P 10 EUR C ART INT V, P628
[6]  
BURCKERT HJ, 1991, LECT NOTES ARTIFICIA, V568
[7]  
DENGLER D, 1994, P 11 EUR C ART INT A, P610
[8]  
FISHER M, 1992, P INT C LOG PROGR AU, P369
[9]   THE SUBSTITUTIONAL FRAMEWORK FOR SORTED DEDUCTION - FUNDAMENTAL RESULTS ON HYBRID REASONING [J].
FRISCH, AM .
ARTIFICIAL INTELLIGENCE, 1991, 49 (1-3) :161-198
[10]  
FRISCH AM, 1991, PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, P196