Simultaneous replacement in normal programs

A. Bossi, N. Cocco, S. Etalle

    Research output: Contribution to journalArticleAcademicpeer-review

    11 Citations (Scopus)


    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.
    Original languageEnglish
    Pages (from-to)79-120
    Number of pages42
    JournalJournal of Logic and Computation
    Issue number1
    Publication statusPublished - 1996


    Dive into the research topics of 'Simultaneous replacement in normal programs'. Together they form a unique fingerprint.

    Cite this