Combining Logic Programs and Monadic Second Order Logics by Program Transformation

Fabio Fioravanti,Alberto Pettorossi,Maurizio Proietti

doi:10.1007/3-540-45013-0_14

Combining Logic Programs and Monadic Second Order Logics by Program Transformation

Fabio Fioravanti, Alberto Pettorossi + Show 1 more

Open Access

https://doi.org/10.1007/3-540-45013-0_14

Copy DOI

Publication Date: Jan 1, 2003

Citations: 21

Affiliation: University of Rome Tor Vergata, Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti

#Logic Programs #Synthesis Method + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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.

Full Text

Paper version not known

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.