A Resolution Prover for Coalition Logic

@inproceedings{Nalon2014ARP,
  title={A Resolution Prover for Coalition Logic},
  author={Cl{\'a}udia Nalon and Lan Zhang and Clare Dixon and Ullrich Hustadt},
  booktitle={SR},
  year={2014}
}
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… 
View PDF on arXiv
2 Citations
Background Citations
1
Methods Citations
1

Figures from this paper

2 Citations

Ordered Resolution for Coalition Logic

A calculus based on ordered resolution for Coalition Logic CL is introduced, improving the previous approach based on unrefined resolution, and it is shown that it outperforms a tableau-based decision procedure for Alternating-Time Temporal Logici?źCL on two classes of benchmark formulae for CL.

Nonmonotonic reasoning and learning in biological networks

  • 2015

References

SHOWING 1-10 OF 17 REFERENCES

A resolution-based calculus for Coalition Logic

A normal form and a set of inference rules to solve the satisfiability problem in CL, a non-normal modal logic used for reasoning about cooperative agency, are introduced.

A resolution-based calculus for Coalition Logic ( Extended Version )

We present a resolution-based calculus for the Coalition Logic CL, a non-normal modal logic used for reasoning about cooperative agency. We present a normal form and a set of resolution-based…

A Modal Logic for Coalitional Power in Games

  • M. Pauly
  • Computer Science
    J. Log. Comput.
  • 2002
A modal logic to formalize reasoning about effectivity in game frames, where expresses that coalition is effective for a set of states, is proposed and completeness proved.

An Experimental Comparison of Theorem Provers for CTL

We compare implementations of five theorem provers for Computation Tree Logic (CTL) based on tree-tableaux, graph-tableaux, binary decision diagrams, resolution and games using formula-classes from…

Tableau-based decision procedures for logics of strategic ability in multiagent systems

An incremental tableau-based decision procedure for the alternating-time temporal logic ATL and some of its variants is developed and it is believed that the tableaux are practically more efficient in the average case than other decision procedures for ATL known so far.

Scientific Benchmarking with Temporal Logic Decision Procedures

A hypothesis-driven design of the empirical analysis of different decision procedures for propositional temporal logic is proposed, which is to start by choosing the benchmark problems for which a particular decision procedure is expected to exhibit a behaviour different from another decision procedure.

ATL Satisfiability is Indeed EXPTIME-complete

Although none of these variations fixes the set of agents in advance, this paper is able to prove containment in ExpTime for all of them by means of a type elimination construction—thus improving the existing 2ExpTime upper bound to a tight ExpTime one.

A Machine-Oriented Logic Based on the Resolution Principle

The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.

Monodic temporal resolution

It is shown how several features of monodic FOTL can be established as corollaries of the completeness result for the clausal temporal resolution method, including definitions of new decidable monodic classes, simplification of existing monodic Classes by reductions, and completeness of clausalporal resolution in the case ofmonodic logics with expanding domains.

Alternating-time temporal logic

This work introduces a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves.