Paper Details: Downloads: 620
Serial Number: P1120641002
Title: Verification of Problems Controllability of Constraints Satisfaction under Uncertainty Distribute (DSTPU)
Authors: Ali Rachidi and Driss Mammass
Abstract: The STPU (Simple Temporal Problem Under Uncertainty) is the formalism extension of STP (simple temporal problem) which takes account of the contingent numerical constraints. The controllability of this network replaces from now on the property of consistency. In the literature, a certain number of works were interested in the development of tools of checking of the controllability of the STPU. The expression and the treatment of the distributivity or division of problems of satisfaction of constraints were the object various extensions of the traditional case to the distributed case. In this paper, we develop a polynomial method of propagation and checking of controllability of distributed network STPU. Our approach is inspired by the method DisAC6 (distributed AC6) which tests the arc-consistency of the distributed CSP and the method of propagation of controllability of the traditional STPU
Keywords: I.A., distributed Planning, CSP, DisAC6, STPU, Controllability
Journal/Conference: International Journal of Artificial Intelligence and Machine Learning
Volume: 6
Issue: 4
Submission Date: 8/1/2006 12:00:00 AM
Review Date: 10/1/2006 12:00:00 AM
Publishing Date: 12/1/2006 12:00:00 AM
Article Downloads: 620
Download:

Facebook