@article {klijn2003using,
	title = {Using classical resolution method to check derivability for some propositional paralogics and adaptive logics.},
	year = {2003},
	abstract = {<p>In this article it will be shown how results from [2] can be used to decide wether, for a range of propositional paralogics and adaptive logics L, A1 , ..., An \#L B is derivable by means of a resolution method for C1 , ..., Cn D, where C1 , ..., Cn and D are the translations of the original premisses and the conclusion respectively from L into CL. This method simplifies the use of automated deduction for non-classical logics, since the framework for these logics can be put "on top of" any existing resolution method for classical logic. This theoretical framework has been implemented in a computer program. The URL where this program is available will be given. This approach, moreover, makes it easier to compare the derivability of well formed formulas from sets of premisses between the implemented range of logics. The resulting computer program can thus be seen as an useful tool for research in logics.</p>},
	author = {Klijn, Alex}
}
