کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4663249 | 1345242 | 2006 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the consistency problem for the INDU calculus
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
منطق ریاضی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper, we further investigate the consistency problem for the qualitative temporal calculus INDU introduced by Pujari et al. [A.K. Pujari, G.V. Kumari, A. Sattar, INDU: An interval and duration network, in: Australian Joint Conference on Artificial Intelligence, 1999, pp. 291-303]. We prove the intractability of the consistency problem for the subset of pre-convex relations, and the tractability of strongly pre-convex relations. Furthermore, we also define another interesting set of relations for which the consistency problem can be decided by the â-closure method, a method similar to the usual path-consistency method. Finally, we prove that the â-closure method is also complete for the set of atomic relations of INDU implying that the intervals have the same duration.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Applied Logic - Volume 4, Issue 2, June 2006, Pages 119-140
Journal: Journal of Applied Logic - Volume 4, Issue 2, June 2006, Pages 119-140
نویسندگان
Philippe Balbiani, Jean-François Condotta, Gérard Ligozat,