ملخص
This paper deals with consistency techniques over sequences constraints embedded in Constraint Logic Programming CLPS. CLP Sequences constraints are defined over Hereditarily Homogeneous Finite Sets HHFS built on atomic elements to characterise a family of admissible sequences . The relations we are dealing with are classical sets relations (E,c,=,#) and sequencing relations as potential, metric and range constraints. We define the semantics of these relations with a characteristic range function. The consistency techniques used are incremental reduction of the normal form based on a tiye like representation called PQ-R trees. This allows us to reduce the set of admissible sequences befcre yeneratang solutions.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 804-807 |
عدد الصفحات | 4 |
دورية | Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - 1994 |
منشور خارجيًا | نعم |
الحدث | Proceedings of the 6th International Conference on Tools with Artificial Intelligence - New Orleans, LA, USA المدة: نوفمبر ٦ ١٩٩٤ → نوفمبر ٩ ١٩٩٤ |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1712???
- ???subjectarea.asjc.1700.1702???
- ???subjectarea.asjc.1700.1706???