Software
g4c-reasoner: An implementation of proof search in a sequent system with defined formulae and ground sequents used to check logical implications between the formal eligibility criteria of Austrian business grants. See also the article Grants4Companies: Applying declarative methods for recommending and reasoning about business grants in the Austrian public administration (System description).
iiProve: An implementation of proof search and countermodel generation for intuitionistic and intermediate logics based on the newly introduced framework of injective nested sequents. The implementation is based on the article Interpolation for Intermediate Logics via Injective Nested Sequents (to appear).
deonticProver 2.0: An implementation of the general prover for reasoning from assumptions in deontic logics using specificity and superiority as conflict resolution methods. The implementation is based on the article Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms.
nnProver: An implementation of proof search and countermodel construction for bimodal monotone logic M, aka., Brown's logic of ability, in the framework of nested sequents. The implementation is based on the article Combining monotone and normal modal logic in nested sequents -- with countermodels. The source code is available on github here.
deonticProver: A prototype implementation of the methods for reasoning with the specificity principle in deontic (or modal) logics as developed in the article Resolving Conflicting Obligations in Mīmāṃsā: A Sequent-based Approach. The source code is available on github here.
VINTE: An implementation of the standard sequent calculi for Lewis' conditional logics presented in Standard Sequent Calculi for Lewis' Logics of Counterfactuals. The system description was published as VINTE: an Implementation of Internal Calculi for Lewis' Logics for Counterfactual Reasoning.
LNSprover: An implementation of a modular theorem prover for a number of normal and non-normal modal logics using linear nested sequent calculi. The source code is also available on github.
Some of the methods and systems of the paper Proof Search in Nested Sequent Systems have been implemented by Elaine Pimentel in the prover POULE. (Please drop me a line if the link does not work, we had some issues with the server lately.)