Modules and Logic Programming
| dc.creator | Fouquere, Christophe | |
| dc.creator | Mogbil, Virgile | |
| dc.date | 2004-11-10 | |
| dc.date.accessioned | 2026-07-07T03:21:58Z | |
| dc.date.available | 2026-07-07T03:21:58Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0411029 | |
| dc.identifier | http://arxiv.org/abs/cs/0411029 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32419 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Modules and Logic Programming | |
| dc.type | text |