Combining Logic Programs and Monadic Second Order Logics by Program Transformation
<|reference_start|>Combining Logic Programs and Monadic Second Order Logics by Program Transformation: We present a program synthesis method based on unfold/fold transformation rules which can be used for deriving terminating definite logic programs from formulas of the Weak Monadic Second Order theory of one successor (WS1S). This synthesis method can also be used as a proof method which is a decision procedure for closed formulas of WS1S. We apply our synthesis method for translating CLP(WS1S) programs into logic programs and we use it also as a proof method for verifying safety properties of infinite state systems.<|reference_end|>
@article{fioravanti2003combining,
    title={Combining Logic Programs and Monadic Second Order Logics by Program
  Transformation},
    author={F. Fioravanti, A. Pettorossi, M. Proietti},
    journal={arXiv preprint arXiv:cs/0311043},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0311043},
    primaryClass={cs.PL cs.LO}
}