A game semantics for disjunctive logic programming |
| |
Authors: | Thanos Tsouanas |
| |
Institution: | Laboratoire de l?Informatique du Parallélisme, École Normale Supérieure de Lyon, Université de Lyon, LIP (UMR 5668 CNRS ENS Lyon UCBL INRIA), 46 allée d?Italie, 69364 Lyon cedex 07, France |
| |
Abstract: | 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. |
| |
Keywords: | 03B70 68N17 68Q55 91A40 |
本文献已被 ScienceDirect 等数据库收录! |
|