judge: Tableau-based theorem prover for justification logic.

[ gpl, library, logic, program ] [ Propose Tags ]
Versions [RSS],
Change log CHANGELOG.md
Dependencies aeson (>= && <, ansi-wl-pprint (>= && <, attoparsec (>= && <, base (>=4.7 && <5), bytestring (>= && <, containers (>= && <, directory (>= && <, filepath (>= && <, judge, mtl (==2.2.1), optparse-applicative (>= && <, pointedlist (==0.6.1), terminal-size (==, texmath (>=0.10.1 && <0.11.0), text (==, transformers (==, unordered-containers (==, utf8-string (==, vector (>= && <, yaml (>=0.8.23 && <0.8.26) [details]
License GPL-3.0-only
Author ns@slak.ws
Maintainer ns@slak.ws
Category Logic
Home page https://github.com/slakkenhuis/judge#readme
Source repo head: git clone https://github.com/slakkenhuis/judge
Uploaded by slakkenhuis at 2018-03-14T23:45:10Z
Executables judge
Downloads 1173 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-03-14 [all 1 reports]

Readme for judge-

[back to package description]


judge is a modular implementation of a decision procedure for classical and justification logics, through a tableau-based theorem prover.


judge can be installed through Cabal:

cabal sandbox init
cabal install judge

A recommended alternative is to use Stack, for which you will need to clone the repository and do:

stack install


judge expects a logical system to be defined in the YAML or JSON format. This file will specify the type of proof system and the logical family (although at the moment, only the respective values tableau and justification are recognised). It also provides the rules of inference. See the logic directory for example specifications.

If no target formula(s) are provided via -g, formulas are read off the standard input. If no output file is provided via -o, the result is written to the standard output. By default, the format is plain text; add -f LaTeX to obtain LaTeX code instead.

For example, the following will construct proofs for theorems of the logic LP (with c:(A→B→A) ∊ CS), and produces a PDF file to visualise them:

judge LP \
    -a "c:(A->B->A)" \
    -f LaTeX \
     < formulas.txt \
     | pdflatex


Notable missing features are detailed on the issue tracker.

Contributions that extend judge to different logical families (modal, first order...) or proof systems (sequent, natural deduction...) are welcomed.