CK+CEM+MP(+ID), CK+CSO(+MP+CEM) are not available.
Remember that flat CK+ID+CSO=cumulative logic C
NESCOND's performances are promising. We have compared them with the ones of CondLean's and GoalDUCK's. For the flat fragment of CK+CSO+ID we have compared NESCOND with KLMLean, a theorem prover for KLM logics. Here are some statistics from our experiments.
|Test for CK: NESCOND vs CondLean vs UCK||Prolog code|
|Test for extensions of CK: valid formulas||Formulas|
|Test for CK+CSO+ID: NESCOND vs KLMLEan||Prolog code|
Copyright 2013 Nicola Olivetti, Gian Luca Pozzato. NESCOND is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. NESCOND is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with NESCOND. If not, see http://www.gnu.org/licenses/.