Bernhard Beckert. Depth-first proof search without backtracking for free-variable clausal tableaux. Journal of Symbolic Computation, 36(1-2):117-138, 2003. [doi]
@article{Beckert03,
title = {Depth-first proof search without backtracking for free-variable clausal tableaux},
author = {Bernhard Beckert},
year = {2003},
doi = {10.1016/S0747-7171(03)00026-9},
url = {http://dx.doi.org/10.1016/S0747-7171(03)00026-9},
tags = {search},
researchr = {https://researchr.org/publication/Beckert03},
cites = {0},
citedby = {0},
journal = {Journal of Symbolic Computation},
volume = {36},
number = {1-2},
pages = {117-138},
}