NESCOND: an implementation of nested sequent calculi for conditional logics

DOI10.1007/978-3-319-08587-6_39MaRDI QIDQ3192215zbMATH OpenOpenAlexFDO

Authors N. Olivetti, G. L. Pozzato

Publication date 26 September 2014

Published in Automated Reasoning (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2318/152376

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Nested sequent calculi for normal conditional logics
• CondLean: a theorem prover for conditional logics
• Nested sequent calculi for conditional logics
• A sequent calculus and a theorem prover for standard conditional logics
• Automated Reasoning with Analytic Tableaux and Related Methods

Cited in

(10)

• From input/output logics to conditional logics via sequents -- with provers
• Nested sequent calculi for normal conditional logics
• Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi
• Nested sequent calculi for conditional logics
• MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
• CondLean: a theorem prover for conditional logics
• A sequent calculus and a theorem prover for standard conditional logics
• Automated Reasoning with Analytic Tableaux and Related Methods
• Mechanising Gödel-Löb provability logic in HOL light
• Scaling up reasoning from conditional belief bases

Describes a project that uses

Uses Software

• NESCOND

This page was built for publication: NESCOND: an implementation of nested sequent calculi for conditional logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192215)