(Mechanical) Reasoning on Infinite Extensive Games
Pierre Lescanne (LIP)
TL;DR
This paper explores reasoning in infinite extensive games by conducting experiments within the Coq proof assistant to enhance understanding of such complex game structures.
Contribution
It introduces a novel experimental approach using Coq to analyze reasoning processes in infinite extensive games.
Findings
Demonstrated the feasibility of formal reasoning on infinite games in Coq
Provided insights into the structure of reasoning in infinite game scenarios
Established a foundation for future formal analysis of infinite extensive games
Abstract
In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed experiments in the proof assistant Coq that are reported here.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Artificial Intelligence in Games · Logic, Reasoning, and Knowledge