@incollection {D:pdmdp,
	title = {On a Partial Decision Method for Dynamic Proofs},
	booktitle = {P{C}{L} 2002. Paraconsistent Computational Logic},
	volume = {95},
	year = {2002},
	note = {<p>Also available as cs.LO/0207090 at \texttt{http://arxiv.org/archive/cs/intro.html}</p>},
	pages = {91{\textendash}108},
	publisher = {Roskilde University},
	abstract = {<p>This paper concerns a goal directed proof procedure for the propositional fragment of the adaptive logic ACLuN1. At the propositional level, it forms an algorithm for final derivability. If extended to the predicative level, it provides a criterion for final derivability. This is essential in view of the absence of a positive test. The procedure may be generalized to all flat adaptive logics.</p>},
	url = {http://arxiv.org/abs/cs.LO/0207090},
	author = {Batens, Diderik},
	editor = {Dekker, Hendrik and Villadsen, Jorgen and Waragai, Toshiharu}
}
