Planning under Description Logic ?--an obstacle towards WSAC

hi all,
I've just read all the discussion about applying AI planning technique to SWS.
I notice that most traditional planning algorithm are based on first
order logic, which is based on close-world assumption. And I also
notice that in order
to achieve true automatic composition of web service, we must tackle
the problem of planning under description logic, which is based on
open-world assumption.

The question is :
When using DL to describe world state, what adaptions should
traditional AI planning techniques make?
For example,
TBOX: EffectA = intersectionOf(EffectB,EffectC)
ABOX: a individual EffectA
Then we can choose an operation that achieves EffectA or we can choose
two operations (one achieves EffectB and the other achieves EffectC).
It's a little like adding some common rules 
(in this case EffectB(x) and EffectC(x)->EffectA(x)) 
to traditional planning domain. When EffectB and EffectC are not
atomic concepts, the situation becomes more complex. How to handle
this kind of things in planning algorithms?

Best regards!
Manshan Lin 
Affiliation: School of Computer Science and Engineering, the South
China University of Technology
Phone: (+86)13711287277
            \ " 
  ___0__/  |
       /_      |
 .__/   \_.   |

Received on Thursday, 2 December 2004 01:40:00 UTC