Game characterizations of logic program properties
From MaRDI portal
Recommendations
Cites work
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 708664 (Why is no real title available?)
- scientific article; zbMATH DE number 789391 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- The expressiveness of locally stratified programs
- The recursion-theoretic complexity of the semantics of predicate logic as a programming language
Cited in
(8)- An infinite-game semantics for well-founded negation in logic programming
- Measure Properties of Game Tree Languages
- Reasoning About Substructures and Games
- scientific article; zbMATH DE number 978238 (Why is no real title available?)
- Propositional dynamic logic for searching games with errors
- scientific article; zbMATH DE number 2096829 (Why is no real title available?)
- Exploiting Game Theory for Analysing Justifications
- A Procedural Characterization of Solution Concepts in Games
This page was built for publication: Game characterizations of logic program properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101444)