Skip to main content
Conference Proceedings

Perfect model checking via unfold/fold transformations

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (2000) 1861 613-628
DOI: 10.1007/3-540-44957-4_41
24Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show how unfold/fold program transformation techniques may be used for proving that a closed first order formula holds in the perfect model of a logic program with locally stratified negation. We present a program transformation strategy which is a decision procedure for some given classes of programs and formulas.

Cite

CITATION STYLE

APA

Pettorossi, A., & Proietti, M. (2000). Perfect model checking via unfold/fold transformations. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1861, pp. 613–628). Springer Verlag. https://doi.org/10.1007/3-540-44957-4_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free