@article {JDa:ddp_cc,
	title = {Direct Dynamic Proofs for Classical Compatibility},
	journal = {Logique et Analyse},
	volume = {47},
	number = {185{\textendash}188},
	year = {2004},
	pages = {305{\textendash}317},
	abstract = {<p>In this paper, we present a goal-directed proof procedure for abductive reasoning. This procedure will be compared with Alisedas approach based on semantic tableaux. We begin with some comments on Alisedas algorithms for computing conjunctive abductions and show that they do not entirely live up to their aims. Next we give a concise account of goal-directed proofs and we show that abductive explanations are a natural spin-off of these proofs. Finally, we show that the goal-directed procedure solves the problems we encountered in Alisedas algorithms.</p>},
	author = {Meheus, Joke and Provijn, Dagmar}
}
@incollection {290835,
	title = {Direct dynamic proofs for compatibility.},
	booktitle = {Computer modeling of scientific reasoning},
	year = {2003},
	pages = {179{\textendash}187},
	publisher = {Universidad Nacional Del Sur. EDIUNS},
	address = {Bahia Blanca, Argentinia},
	isbn = {987-9281-89-6},
	author = {Provijn, Dagmar},
	editor = {Delrieux, Claudio and Legris, Javier}
}
