Dissemin is shutting down on January 1st, 2025

Published in

Springer Verlag, Lecture Notes in Computer Science, p. 481-482

DOI: 10.1007/978-3-540-24599-5_33

Links

Tools

Export citation

Search in Google Scholar

A Generic Persistence Model for (C)LP Systems

Proceedings article published in 2003 by J. Correas, J. M. Gomez, M. Carro, D. Cabeza, M. Hermenegildo ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

ng persistence once and for all in a reusable (system) library providing the class of persistent predicates. The main e#ect of declaring a predicate persistent (a process for which we propose a suitable syntax, compatible with the Ciao system's assertion language) is that any changes made to such predicates persist from one execution to the next one, and are transactional, and, optionally, externally visible. The model allows associating an external, persistent storage medium (a file, a database table, etc.) to each such predicate, which will "reside" in that medium. Notably, persistent predicates appear to a program as ordinary (dynamic) predicates: calls to them do not need to be coded or marked specially, and the builtins to update them are (suitably modified versions of) the same used with the internal database (e.g., asserta/1, assertz/1, retract/1, etc.). Thus, only minor modifications to the program code (often independent of its internal logic) are needed to achieve persistence