Abstract
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 leanTAP 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/
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alenda, R., Olivetti, N., Pozzato, G.L.: Nested Sequent Calculi for Conditional Logics. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 14–27. Springer, Heidelberg (2012)
Alenda, R., Olivetti, N., Pozzato, G.L.: Nested Sequents Calculi for Normal Conditional Logics. Journal of Logic and Computation (to appear)
Beckert, B., Posegga, J.: leantap: Lean tableau-based deduction. JAR 15(3), 339–358 (1995)
Brünnler, K., Studer, T.: Syntactic cut-elimination for common knowledge. Annals of Pure and Applied Logic 160(1), 82–95 (2009)
Fitting, M.: Prefixed tableaus and nested sequents. A. Pure App. Log. 163(3), 291–313 (2012)
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)
Hausmann, D., Schröder, L.: Optimizing Conditional Logic Reasoning within CoLoSS. Electronic Notes in Theoretical Computer Science 262, 157–171 (2010)
Kashima, R.: Cut-free sequent calculi for some tense logics. St. Logica 53(1), 119–136 (1994)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1-2), 167–207 (1990)
Lewis, D.: Counterfactuals. Basil Blackwell Ltd. (1973)
Nute, D.: Topics in conditional logic. Reidel, Dordrecht (1980)
Olivetti, N., Pozzato, G.L.: CondLean 3.0: Improving Condlean for Stronger Conditional Logics. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 328–332. Springer, Heidelberg (2005)
Olivetti, N., Pozzato, G.L.: Theorem Proving for Conditional Logics: CondLean and GoalDuck. Journal of Applied Non-Classical Logics (JANCL) 18(4), 427–473 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Olivetti, N., Pozzato, G.L. (2014). NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics. In: Demri, S., Kapur, D., Weidenbach, C. (eds) Automated Reasoning. IJCAR 2014. Lecture Notes in Computer Science(), vol 8562. Springer, Cham. https://doi.org/10.1007/978-3-319-08587-6_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-08587-6_39
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08586-9
Online ISBN: 978-3-319-08587-6
eBook Packages: Computer ScienceComputer Science (R0)