The system nmproblog solves the following problems in nonmonotonic probabilistic and default reasoning:

• deciding consistency and computing tight entailed intervals in weak / strong / variable-strength nonmonotonic probabilistic logics (probabilistic System P, probabilistic System Z, and probabilistic lexicographic entailment);
• deciding satisfiability and computing tight entailed intervals in ordinary / variable-strength model-theoretic probabilistic logic;
  
• deciding consistency and computing tight entailed intervals in probabilistic logic under g-coherence;
• deciding consistency and entailment in default reasoning (System P, System Z, and lexicographic entailment).

It is written in C and uses lp_solve 5.1 for deciding the solvability of systems of linear constraints and for computing the optimal values of linear programs. The GUI of nmproblog has been built using glade 2.6. The executable for linux and some examples are available here.

Here are some screenshots of the main components of nmproblog:

• Main window:





• Window for checking satisfiability:





• Window for checking consistency:





• Window for computing the z-partition:





• Window for computing tight entailed intervals: