RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication
Contribución de congreso (ConferenceOutput)
Reversible Computations in Logic Programming
[EN] In this work, we say that a computation is reversible if one can find a procedure to undo the steps of a standard (or forward) computation in a deterministic way. While logic programs are often invertible (e.g., one can use the same predicate for adding and for subtracting natural numbers), computations are not reversible in the above sense. In this paper, we present a so-called Landauer embedding for SLD resolution, the operational principle of logic programs, so that it becomes reversible. A proof-of-concept implementation of a reversible debugger for Prolog that follows the ideas in this paper has been developed and is publicly available., This work is partially supported by the EU (FEDER) and the Spanish MCI/AEI under grants TIN2016-76843-C4-1-R/PID2019-104735RB-C41, by the Generalitat Valenciana under grant Prometeo/2019/098 (DeepTrust), and by the COST Action IC1405 on Reversible Computation - extending horizons of computing.
Project:
Agencia Estatal de Investigación / Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020 PID2019-104735RB-C41
,
European Cooperation in Science and Technology / COST Action IC1405
,
Agencia Estatal de Investigación TIN2016-76843-C4-1-R
,
Generalitat Valenciana PROMETEO/2019/098