Sequent calculi and an efficient theorem prover for conditional logics with selection function semantics

Abstract In this paper we present our final solution to the problem of designing an efficient theorem prover for Conditional Logics with the selection function semantics. Conditional Logics recently have received a renewed attention and have found several applications in knowledge representation and artificial intelligence. In order to provide an efficient theorem prover for Conditional Logics, we introduce labelled sequent calculi for the logics characterized by well-established axioms systems including the axiom of strong centering CS, the axiom of conditional identity ID, the axiom of conditional modus ponens MP, as well as the conditional third excluded middle CEM, rejected by Lewis but endorsed by Stalnaker, as well as for the whole cube of extensions. The proposed calculi revise and improve the calculi SeqS introduced in Olivetti et al. (2007, ACM Trans. Comput. Logics, 8). We also present an implementation of these calculi in SWI Prolog, including a graphical interface in Python as well as standard heuristics and refinements that allow us to obtain an efficient theorem prover for the logics under consideration. Moreover, we present some statistics about the performances of the theorem prover, which are promising and significantly better than those of its predecessor CondLean, an implementation of the calculi SeqS.