Game characterizations of logic program properties

DOI10.1007/3-540-59487-6_8zbMath1496.68084OpenAlexW1568244765MaRDI QIDQ5101444

Howard A. Blair

Publication date: 30 August 2022

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59487-6_8

Mathematics Subject Classification ID

2-person games (91A05) Logic programming (68N17) Ordinal and cardinal numbers (03E10) Hierarchies of computability and definability (03D55)

Related Items (1)

Exploiting Game Theory for Analysing Justifications

Cites Work

• Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
• The expressiveness of locally stratified programs
• The recursion-theoretic complexity of the semantics of predicate logic as a programming language
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Game characterizations of logic program properties