NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics
We present NESCOND, a theorem prover for normal conditional logics. NESCOND implements some recently introduced NESted sequent calculi for propositional CONDitional logics CK and some of its significant extensions with axioms ID, MP and CEM. It also deals with the flat fragment of CK+CSO+ID, which corresponds to the logic C introduced by Kraus, Lehmann and Magidor. NESCOND is inspired by the methodology of leanT A P and it is implemented in Prolog. The paper shows some experimental results, witnessing that the performances of NESCOND are promising. The program NESCOND, as well as all the Prolog source files, are available at http://www.di.unito.it/~pozzato/nescond/
KeywordsSequent Calculus Nest Sequent Nonmonotonic Reasoning Conditional Logic Proof Search
Unable to display preview. Download preview PDF.
- 2.Alenda, R., Olivetti, N., Pozzato, G.L.: Nested Sequents Calculi for Normal Conditional Logics. Journal of Logic and Computation (to appear)Google Scholar
- 6.Goré, R., Postniece, L., Tiu, A.: Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents. In: Advances in Modal Logic, vol. 7, pp. 43–66 (2008)Google Scholar
- 10.Lewis, D.: Counterfactuals. Basil Blackwell Ltd. (1973)Google Scholar
- 11.Nute, D.: Topics in conditional logic. Reidel, Dordrecht (1980)Google Scholar