@INPROCEEDINGS{Hanus21KPS,
author    = "Hanus, M.",
title     = "Can Logic Programming Be Liberated from Backtracking?",
year      = "2021",
booktitle = "Tagungsband zum 21. Kolloquium Programmiersprachen und Grundlagen der Programmierung",
pages     = "40-47",
number    = "2021/7",
doi       = "10.21941/kcss/2021/7",
address   = "Kiel, Germany",
series    = "Kiel Computer Science Series",
abstract = {
Logic programming is historically tight with Prolog and its
backtracking search strategy.
The use of backtracking was justified by efficiency reasons
when Prolog was invented and is still present,
although the incompleteness of backtracking
destroys the elegant connection of logic programming
and the underlying Horn clause logic. Moreover, it causes
difficulties to teach logic programming.
In this paper we argue that this is no longer necessary
if new implementation approaches are taken into account.
}
}