A game semantics for disjunctive logic programming

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...

Full description

Saved in:
Bibliographic Details
Published in:Annals of pure and applied logic Vol. 164; no. 11; pp. 1144 - 1175
Main Author: Tsouanas, Thanos
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.2013
Elsevier Masson
Subjects:
Computer Science
Computer Science and Game Theory
Disjunctive logic programming
Game semantics
Logic programming
Logic programming semantics
Programming Languages
68N17
Disjunctive logic programming
Logic programming
03B70
Game semantics
Logic programming semantics
68Q55
91A40
logic programming
game semantics
disjunctive logic programming
ISSN:0168-0072
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0168-0072
DOI:10.1016/j.apal.2013.05.008