A resolution prover for coalition logic

C. Nalon, L. Zhang, C. Dixon, U. Hustadt

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolution-based calculus for Coalition Logic that operates on coalition problems, a normal form for Coalition Logic. We provide an overview of coalition problems and of the resolutionbased calculus for Coalition Logic. We then give details of the implementation of CLProver and present the results for a comparison with an existing tableau-based solver.
Original languageEnglish
Title of host publicationElectronic Proceedings in Theoretical Computer Science (EPTCS)
Pages65-73
Number of pages9
Volume146
DOIs
Publication statusPublished - 1 Apr 2014
Event2nd International Workshop on Strategic Reasoning - Grenoble, France
Duration: 5 Apr 20146 Apr 2014
Conference number: 113242

Conference

Conference2nd International Workshop on Strategic Reasoning
Abbreviated titleSR 2014
Country/TerritoryFrance
CityGrenoble
Period5/04/146/04/14

Fingerprint

Dive into the research topics of 'A resolution prover for coalition logic'. Together they form a unique fingerprint.

Cite this