Simultaneous Replacement in Normal Programs

Share/Save/Bookmark

Bossi, Annalisa and Cocco, Nicoletta and Etalle, Sandro (1996) Simultaneous Replacement in Normal Programs. Journal of Logic and Computation, 6 (1). pp. 79-120. ISSN 0955-792X

open access
[img]
Preview
PDF
1MB
Abstract:The simultaneous replacement transformation operation is here defined and studied w.r.t. normal programs. We give applicability conditions able to ensure the correctness of the operation w.r.t. the set of logical consequences of the completed database. We consider separately the cases in which the underlying language is infinite and finite; in this latter case we also distinguish according to the kind of domain closure axioms adopted. As corollaries we obtain results for Fitting's and Kunen's semantics. We also show how simultaneous replacement can mimic other transformation operations such as thinning, fattening and folding, thus producing applicability conditions for them too.
Item Type:Article
Copyright:© 1996 Oxford University Press
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/55939
Official URL:http://dx.doi.org/10.1093/logcom/6.1.79
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page