A Resolution Prover for Coalition Logic

04/03/2014
by   Cláudia Nalon, et al.
0

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 resolution-based 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2020

A cut-free sequent calculus for the bi-intuitionistic logic 2Int

The purpose of this paper is to introduce a bi-intuitionistic sequent ca...
research
07/21/1999

Clausal Temporal Resolution

In this article, we examine how clausal resolution can be applied to a s...
research
03/30/2000

Representation results for defeasible logic

The importance of transformations and normal forms in logic programming,...
research
04/28/2014

Deontic Logic for Human Reasoning

Deontic logic is shown to be applicable for modelling human reasoning. F...
research
04/02/2022

Transfinite Modal Logic: a Semi-quantitative Explanation for Bayesian Reasoning

Bayesian reasoning plays a significant role both in human rationality an...
research
12/14/2018

Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs

The problem of giving a computational meaning to classical reasoning lie...
research
04/15/2022

An Experiment of Randomized Hints on an Axiom of Infinite-Valued Lukasiewicz Logic

In this paper, we present an experiment of our randomized hints strategy...

Please sign up or login with your details

Forgot password? Click here to reset