Modules and Logic Programming
Logic in Computer Science
2007-05-23 v1
Abstract
We study conditions for a concurrent construction of proof-nets in the framework developed by Andreoli in recent papers. We define specific correctness criteria for that purpose. We first study closed modules (i.e. validity of the execution of a logic program), then extend the criterion to open modules (i.e. validity during the execution) distinguishing criteria for acyclicity and connectability in order to allow incremental verification.
Keywords
Cite
@article{arxiv.cs/0411029,
title = {Modules and Logic Programming},
author = {Christophe Fouquere and Virgile Mogbil},
journal= {arXiv preprint arXiv:cs/0411029},
year = {2007}
}