@inproceedings{08bbbf32360e4420950056f23899d389,

title = "Game characterizations of logic program properties",

abstract = "A family of simple two-player games will be presented which vary by how play passes between players and by what constraint must be maintained by the players in order to avoid losing. The players are representable as interacting almost independent logic programs. A correspondence between winning strategies, well-founded dependencies, constructive ordinals and hyperarithmetic sets is presented. Complexity results can be obtained for logic program properties in a uniform way. This paper demonstrates the technique as applied to two apparently divers properties, each of a very high degree of undecidability.",

author = "Blair, {Howard A.}",

year = "1995",

month = jan,

day = "1",

language = "English (US)",

isbn = "9783540594871",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "99--112",

editor = "Anil Nerode and Marek, {V. Wiktor} and Miroslaw Truszczynski",

booktitle = "Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings",

note = "3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995 ; Conference date: 26-06-1995 Through 28-06-1995",

}