Multi-Agent Dialogue Games and Dialogue Sequents for Proof Search and Scheduling

Abstract

Dialogical games as introduced by Lorenzen and Lorenz describe a reasoning technique mainly used for intuitionistic and classical predicate logic: two players (proponent and opponent) argue about the validity of a given formula according to predefined rules. If the proponent has a winning-strategy then the formula is proven to be valid. The underlying game rules can be modified to have an impact on proof search strategies and increase the efficiency of such a searching process. In this paper, a multi-agent version of dialogical logic is introduced that corresponds more to multi-conclusion sequent calculi for propositional intuitionistic logic rather than single-conclusion ones which are more related to two-player dialogues. The rules lead us to a normalization of a proof, let us focus on the proponents’ relevant decisions, and therefore give explicit directives that increase compactness of the proof-searching process. This allows us to perform parts of the proof in a parallel way. Soundness and completeness of this multi-agent system is shown.

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Sticht2016MultiAgentDG, title={Multi-Agent Dialogue Games and Dialogue Sequents for Proof Search and Scheduling}, author={Martin Sticht}, booktitle={CILC}, year={2016} }