Modules and Logic Programming
<|reference_start|>Modules and Logic Programming: 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.<|reference_end|>
@article{fouquere2004modules,
    title={Modules and Logic Programming},
    author={Christophe Fouquere and Virgile Mogbil},
    journal={arXiv preprint arXiv:cs/0411029},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0411029},
    primaryClass={cs.LO}
}