کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4662009 | 1633470 | 2013 | 32 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A game semantics for disjunctive logic programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
منطق ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A game semantics for disjunctive logic programming A game semantics for disjunctive logic programming](/preview/png/4662009.png)
چکیده انگلیسی
Denotational semantics of logic programming and its extensions (by allowing negation, disjunctions, or both) have been studied thoroughly for many years. In 1998, a game semantics was given to definite logic programs by Di Cosmo, Loddo, and Nicolet, and a few years later it was extended to deal with negation by Rondogiannis and Wadge. Both approaches were proven equivalent to the traditional semantics. In this paper we define a game semantics for disjunctive logic programs and prove soundness and completeness with respect to the minimal model semantics of Minker. The overall development has been influenced by the games studied for PCF and functional programming in general, in the styles of Abramsky-Jagadeesan-Malacaria and Hyland-Ong-Nickau.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Annals of Pure and Applied Logic - Volume 164, Issue 11, November 2013, Pages 1144-1175
Journal: Annals of Pure and Applied Logic - Volume 164, Issue 11, November 2013, Pages 1144-1175
نویسندگان
Thanos Tsouanas,