کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9649991 | 658455 | 2005 | 37 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Weak AGM postulates and strong Ramsey Test: A logical formalization
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Weak AGM postulates and strong Ramsey Test: A logical formalization Weak AGM postulates and strong Ramsey Test: A logical formalization](/preview/png/9649991.png)
چکیده انگلیسی
We reformulate AGM postulates for belief revision systems that may contain conditional formulas. We show that we can establish a mapping between belief revision systems and conditionals by means of the so called Ramsey Test, without incurring Gärdenfors triviality result. We then derive the conditional logic BCR from our revision postulates by means of a strong version of the Ramsey Test. We give a sound and complete axiomatization of this logic with respect to its standard selection-function models semantics, and we prove its decidability. We finally show that there is an isomorphism between belief revision systems and selection function models of BCR via a representation theorem. The logic BCR provides a logical formalization of belief revision in the language of conditional logic.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Artificial Intelligence - Volume 168, Issues 1â2, October 2005, Pages 1-37
Journal: Artificial Intelligence - Volume 168, Issues 1â2, October 2005, Pages 1-37
نویسندگان
Laura Giordano, Valentina Gliozzi, Nicola Olivetti,