No abstract

No abstract

No abstract

In this paper, we briefly describe an implementation of a hyper-resolution-based calculus for the propositional basic multimodal logic, Kn. The prover, KSP, is designed to support experimentation with different combinations of refinements for its basic calculus. The prover allows for both local and global reasoning. We present an experimental evaluation that compares KSP with a range of existing reasoners for Kn.

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 inference rules to solve the satisfiability problem in CL. We also show that the calculus presented here is sound, complete, and terminating. ULCS-13-004 Alternatively, A-moves at s ∈ S can be defined as equivalence classes on the set of all move vectors at s, where each equivalence class is determined by the choices of moves of agents in A. Definition 7. We say that a move vector σ extends an A-move vector σ A , denoted by σ A σ or σ σ A , if σ(a) = σ A (a) for every a ∈ A. Given a coalition A ⊆ Σ, an A-move σ A ∈ D(A, s), and a Σ \ A-move σ Σ\A ∈ D(Σ \ A, s), we denote by σ A σ Σ\A the unique σ ∈ D(s) such that both σ A σ and σ Σ\A σ. Definition 8. Let σ A ∈ D(A, s) be an A-move. The outcome of σ A at s, denoted by out(s, σ A), is the set of all states s ∈ S for which there exists a move vector σ ∈ D(s) such that σ A σ and δ(s, σ) = s .