A Sequent Calculus and a Theorem Prover for Standard Conditional Logics

Simple item page
dc.creatorOlivetti, Nicola
dc.creatorPozzato, Gian Luca
dc.creatorSchwind, Camilla
dc.date2004-07-29
dc.date.accessioned2026-07-07T03:21:36Z
dc.date.available2026-07-07T03:21:36Z
dc.descriptionIn this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus uses labels and transition formulas and can be used to prove decidability and space complexity bounds for the respective logics. We also present CondLean, a theorem prover for these logics implementing SeqS calculi written in SICStus Prolog.
dc.description45 pages with 2 figures, uses prooftree.sty
dc.identifierhttps://arxiv.org/abs/cs/0407064
dc.identifierhttp://arxiv.org/abs/cs/0407064
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32263
dc.subjectLogic in Computer Science
dc.subjectArtificial Intelligence
dc.subjectD.1.6; F.4.1; I.2.3
dc.titleA Sequent Calculus and a Theorem Prover for Standard Conditional Logics
dc.typetext

Files

Collections

arXiv