Abstract
We present sufficient conditions for correctness of logic programs with negation (normal programs). We focus on the Kunen semantics, this declarative semantics is a closest one to what is implemented in Prolog (negation by finite failure) when floundering is avoided. We also recall an existing result for the well-founded semantics.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Apt, K., Bol, R.: Logic programming and negation: a survey. J. Logic Program. 19/20, 9–71 (1994)
Apt, K.R.: From Logic Programming to Prolog. International Series in Computer Science, Prentice-Hall, Hoboken (1997)
Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Databases. Springer, Boston (1978). https://doi.org/10.1007/978-1-4684-3384-5_11
Clark, K.L.: Predicate logic as computational formalism. Technical report 79/59. Imperial College, London (1979)
Doets, K.: From Logic to Logic Programming. The MIT Press, Cambridge, MA (1994)
Drabent, W.: What is failure? An approach to constructive negation. Acta Informatica 32(1), 27–59 (1995). https://doi.org/10.1007/BF01185404
Drabent, W.: Completeness of SLDNF-resolution for non-floundering queries. J. Logic Program. 27(2), 89–106 (1996)
Drabent, W.: Correctness and completeness of logic programs. ACM Trans. Comput. Log. 17(3), 18:1-18:32 (2016). https://doi.org/10.1145/2898434
Drabent, W.: Logic + control: on program construction and verification. Theor. Pract. Logic Program. 18(1), 1–29 (2018). https://doi.org/10.1017/S1471068417000047
Drabent, W., Martelli, M.: Strict completion of logic programs. N. Gener. Comput. 9, 69–79 (1991). https://doi.org/10.1007/BF03037151
Drabent, W., Miłkowska, M.: Proving correctness and completeness of normal programs – a declarative approach. Theor. Pract. Logic Program 5(6), 669–711 (2005). https://doi.org/10.1017/S147106840500253X
Ferrand, G., Deransart, P.: Proof method of partial correctness and weak completeness for normal logic programs. J. Logic Program. 17, 265–278 (1993)
Fitting, M.: A Kripke-Kleene semantics for logic programs. J. Logic Program. 2(4), 295–312 (1985)
Fitting, M.: Bilattices and the semantics of logic programming. J. Log. Program. 11(1 &2), 91–116 (1991). https://doi.org/10.1016/0743-1066(91)90014-G
Kunen, K.: Negation in logic programming. J. Log. Program. 4(4), 289–308 (1987)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987). Second, extended edition, https://doi.org/10.1007/978-3-642-83189-8
Nilsson, U., Małuszyński, J.: Logic, Programming and Prolog 2nd edn. John Wiley & Sons Ltd. (1995). http://www.ida.liu.se/~ulfni/lpp/
Shapiro, E.: Algorithmic Program Debugging. The MIT Press, Cambridge (1983)
Stärk, R.F.: From logic programs to inductive definitions. In: Hodges, W., Hyland, M., Steinhorn, C., Truss, J. (eds.) Logic: From Foundations to Applications. European Logic Colloquium ’93, pp. 453–481. Clarendon Press, Oxford (1996). ISBN 978-0-19-853862-2
Stuckey, P.: Constructive negation for constraint logic programming. In: 6th Annual IEEE Symposium on Logic in Computer Science (LICS’91), pp. 328–339 (1991). https://doi.org/10.1109/LICS.1991.151657
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Drabent, W. (2022). On Correctness of Normal Logic Programs. In: Villanueva, A. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2022. Lecture Notes in Computer Science, vol 13474. Springer, Cham. https://doi.org/10.1007/978-3-031-16767-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-16767-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-16766-9
Online ISBN: 978-3-031-16767-6
eBook Packages: Computer ScienceComputer Science (R0)