Combining negation as failure and embedded implications in logic programs

Journal of Logic Programming

Volumn 36, Issue 2, 1998, Pages 91-147

  Giordano, Laura ^a   Olivetti, Nicola ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; LOGIC PROGRAMMING; QUERY LANGUAGES; THEOREM PROVING;

NEGATION AS FAILURE (NAF);

FORMAL LANGUAGES;

EID: 0032143235     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)10014-0     Document Type: Article

References (36)

1. S. Blamey, Partial logic, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, vol. 3, 1986, pp. 1-70.
2. A.J. Bonner, L.T. McCarthy, Adding negation-as-failure to intuitionistic logic programming, in: Proceedings of North American Conference on Logic Programming, Austin, 1990, pp. 681-703.
3. A.J. Bonner, Hypothetical Datalog: Complexity and expressibility, in: Lecture Notes in Computer Science, vol. 326, pp. 144-160.
4. L. Cavedon, J.W. Lloyd, A completeness theorem for SLDNF-resolution, J. Logic Programming 7 (3) (1989) 177-191.
5. P.M. Dung, Strong circumscription specifies the stable semantics of logic programs, in: Proceedings of the European Conference on Artificial Intelligence, Stockholm, 1990.
6. P.M. Dung, Hypothetical logic programming with negation as failure, in: Proceedings of the Third International Workshop on Extensions of Logic Programming, Bologna, February 1992, pp. 61-73, pp. 144-160.
7. M. Fitting, A Kripke/Kleene semantics for logic programs, J. Logic Programming 2 (1985) 295-312.
8. M. Fitting, The family of stable models, J. Logic Programming 17 (1993) 197-225.
9. M. Fitting, On prudent bravery and other abstractions, Preprint, July 1993.
10. D.M. Gabbay, U. Reyle, N-Prolog: An extension of Prolog with hypothetical implications. I, J. Logic Programming 4 (1984) 319-355.
11. D.M. Gabbay, N-Prolog: An extension of Prolog with hypothetical implications. II. Logical foundations and negation as failure, J. Logic Programming 4 (1985) 251-283.
12. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, 1988, pp. 1070-1080.
13. L. Giordano, N. Olivetti, Negation as failure in intuitionistic logic programming, in: Proceedings of the International Conference and Symposium on Logic Programming, Washington, 1992.
14. L. Giordano, A. Martelli, G.F. Rossi, Extending Horn clause logic with implication goals, Theoretical Computer Science 95 (1992) 43-74.
15. J. Harland, A Kripke-like model for negation as failure, in: Proceedings of North American Conference on Logic Programming, 1989, pp. 626-642.
16. J. Harland, A clausal form for the completion of logic programs, in: Proceedings of the Eighth International Conference on Logic Programming, 1991, pp. 711-725.
17. J. Harland, Success and failure for hereditary Harrop formulae, J. Logic Programming 17 (1993) 1-29.
18. K. Kunen, Negation in logic programming, J. Logic Programming 4 (1987) 289-308.
19. K. Kunen, Signed data dependencies in logic programs, J, Logic Programming 7 (1989) 231-245.
20. V. Lifschitz, On the declarative semantics of logic programs with negation, in: J, Minker (EdJ, Foundations of deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 177-192.
21. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1984.
22. L.T. McCarty, Clausal intuitionistic logic, I. Fixed-point semantics, J. Logic Programming 5 (1) (1988) I-31.
23. L.T. McCarty, Clausal intuitionistic logic. II. Tableau proof procedures, J. Logic Programming 5 (2) (1988) 93-132.
24. L.T. McCarty, Circumscribing embedded implications (without stratification), J. Logic Programming 17 (1993) 323-364.
25. D. Miller, A theory of modules for logic programming, IEEE Symposium on Logic Programming, September 1986, pp. 106-114.
26. D. Miller, A logical analysis of modules in logic programming, J. Logic Programming 6 (1989) 79-108.
27. D. Miller, G. Nadatur, F. Pfenning, A. Scedrov, Uniform proofs as a foundation of logic programming, Ann. Pure Appl. Logic 51 (1991) 125-157.
28. N. Olivetti, L. Terracini, N-Prolog and equivalence of logic programs, J. Logic, Language and Information 1 (4) (1992) 253-340.
29. T.C. Przymusinski, On the declarative semantics of stratified deductive databases and logic programming, in: J. Minker (Ed.), Foundations of deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 193-216.
30. J.C. Shepherdson, Negation as failure: A comparison of Clark's completed data base and Reiter's closed world assumption, J. Logic Programming 1 (1984) 51-79.
31. J.C. Shepherdson, Negation as failure II, J. Logic Programming 2 (3) (1985) 185-202.
32. R. F. Stärk, A complete axiomatization of the three-valued completion of logic programs, Journal of Logic and Computation 6 (4) (1991) 811-834.
33. A. Urquhart, Many-valued, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, vol. III, Reider, Dordrecht, 1984, pp. 71-116.
34. A. Van Gelder, K. Ross, J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in: Proceedings of the Seventh ACM Symposium on Principles of Database Systems, 1988, pp. 221-230.
35. M. Wajsberg, Axiomatization of 3-valued sentential calculus, in: S. McCall (Ed.), Polish Logic 1920-1939, Oxford Univ. Press, Oxford, 1967 (English translation of Comptes Rendus des Seances de la Societé des Sciences et des Lettres de Varsovie, Classe III 24 (1931) 126-148).
36. M. Wajsberg, Axiomatization of 3-valued sentential calculus, in: S. McCall (Ed.), Polish Logic 1920- 1939, Oxford Univ. Press, Oxford, 1967 (English translation of Comptes Rendus des Seances de la Societé des Sciences et des Lettres de Varsovie, Classe III 24 (1931) 126-148).