Abstract
In this paper, we propose an extension of a technique transforming logic programs into a particular class of logic programs called CS-programs. Up to now, this technique is a semi-algorithm preserving the least Herbrand model. We integrate in this technique a process of generalization. Thanks to it, we are able to make the computation (the transformation) terminate and if we force the computation to terminate then we obtain a CS-program whose least Herbrand model contains the initial one. In this way, we can tackle successfully reachability problems that are out of the scope of techniques using regular approximations and also of the initial transformation technique (for which computations do not terminate).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We assume that the clause and G are renamed apart in order to have distinct variables.
- 2.
In former papers, synchronized tree-tuple languages were defined thanks to sorts of grammars, called constraint systems. Thus “CS” stands for Constraint System.
References
Boichut, Y., Héam, P.-C.: A theoretical limit for safety verification techniques with regular fix-point computations. Inf. Process. Lett. 108(1), 1–2 (2008)
Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular (tree) model checking. J. Softw. Tools Technol. Transf. 14(2), 167–191 (2012)
Genet, T.: Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 151–165. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0052368
Gouranton, V., Réty, P., Seidl, H.: Synchronized tree languages revisited and new applications. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 214–229. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45315-6_14
Kafle, B., Gallagher, J.P.: Tree automata-based refinement with application to horn clause verification. In: D’Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 209–226. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46081-8_12
Limet, S., Réty, P.: E-unification by means of tree tuple synchronized grammars. Discrete Math. Theor. Comput. Sci. 1(1), 69–98 (1997)
Limet, S., Salzer, G.: Proving properties of term rewrite systems via logic programs. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 170–184. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-25979-4_12
Limet, S., Salzer, G.: Tree tuple languages from the logic programming point of view. J. Autom. Reason. 37(4), 323–349 (2006)
Pettorossi, A., Proietti, M.: Transformation of logic programs. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 697–787. Oxford University Press, Oxford (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Boichut, Y., Pelletier, V., Réty, P. (2018). Approximating Any Logic Program by a CS-Program. In: Rusu, V. (eds) Rewriting Logic and Its Applications. WRLA 2018. Lecture Notes in Computer Science(), vol 11152. Springer, Cham. https://doi.org/10.1007/978-3-319-99840-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-99840-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99839-8
Online ISBN: 978-3-319-99840-4
eBook Packages: Computer ScienceComputer Science (R0)