Intensional negation of logic programs: Examples and implementation techniques

  • Roberto Barbuti
  • Paolo Mancarella
  • Dino Pedreschi
  • Franco Turini
Session CFLP 2 Language Features And Compilation In Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 250)


Intensional negation is a transformation technique which, given the Horn clause definitions of a set of predicates pi, synthesizes the definitions of new predicates, pi∼ the meaning of which is the effective part of the complement of pi's success set. The main advantage with respect to the standard negation as failure rule is the symmetry in handling both positive and negative information, up the ability of computing non ground negative goals as well as producing non ground output as result of negative queries.


  1. [1]
    Ambriola,V., Giannotti,F., Pedreschi,D., Turini,F. “Symbolic Semantics Semantics and Program Reduction”. IEEE Trans. on Soft. Eng. SE-11,8 (Aug.85) 784–794.Google Scholar
  2. [2]
    Apt, K.R., Van Emden M.H. “Contribution to the Theory of Logic Programming”. J.ACM, 29, 3, (1982) 841–862.Google Scholar
  3. [3]
    Aquilano, C., Barbuti, R., Bocchetti, P., Martelli, M. “Negation as Failure: Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions”. Journal of Automated Reasoning, 2 (1986) 155–170.Google Scholar
  4. [4]
    Barbuti,R., Mancarella,P., Pedreschi,D., Turini,F. “Intensional Negation of Logic Programs”. submitted for publication to the Journal of Logic Programming (1986).Google Scholar
  5. [5]
    Barbuti, R., Martelli, M. “Completeness of the SLDNF-Resolution for a Class of Logic Programs”. Proc. of 3rd Int. Conf. on Logic Programming, London, July 14–18 (1986).Google Scholar
  6. [6]
    Barr, A., Feigenbaum, E.A. (Eds.) The Handbook of Artificial Intelligence. Vol.1, Pitman, London (1981).Google Scholar
  7. [7]
    Clark, K.L. “Negation as Failure”. in Logic and Data Bases (Gallaire, H. and Minker, J. Eds.) Plenum, New York (1978) 293–322.Google Scholar
  8. [8]
    Gallaire, H., Minker, J., Nicolas, J.M. “Logic and Databases: a Deductive Approach”. ACM Comp.Surv. 16,2 (June 1984) 153–186.Google Scholar
  9. [9]
    Jaffar,J., Lassez,J.-L., Lloyd,J.W. “Completeness of the Negation-as-Failure Rule”. Proc. 8th Int. Joint Conf. on Art. Int., Karlsruhe (1983) 500–506.Google Scholar
  10. [10]
    Kowalski, R.A. Logic for Problem Solving. Elsevier North Holland, New York (1979).Google Scholar
  11. [11]
    Kowalski, R.A. “Logic Programming”. Proc. IFIP 83, Paris (1983) 133–145.Google Scholar
  12. [12]
    Lassez,J.-L., Maher,M. “Closures and Fairness in the Semantics of Logic Programming”. TCS, 29 (1984)Google Scholar
  13. [13]
    Lassez,J.-L., Marriot,K. “Explicit and Implicit Representation of Terms Defined by Counter Examples”. to appear in Journal of Automated Reasoning.Google Scholar
  14. [14]
    Lloyd, J.W., Topor, R.W. “A Basis for Deductive Data Base Systems”. Journal of Logic Programming, 2,2 (1985) 93–103.Google Scholar
  15. [15]
    Lloyd, J.W., Topor, R.W. “A Basis for Deductive Data Base Systems II”. Journal of Logic Programming, 1 (1986) 55–67.Google Scholar
  16. [16]
    Lloyd, J.W. Foundations of Logic Programming. Springer Symbolic Computation Series, Berlin (1984).Google Scholar
  17. [17]
    Reiter, R. “On Closed World Data Bases”. in Logic and Data Bases (Gallaire, H. and Minker, J. Eds.) Plenum, New York (1978) 55–76.Google Scholar
  18. [18]
    Sato,T., Tamaki,H. “Transformational Logic Program Synthesis”. Proc. Conf. on Fifth Generation Computer Systems, (1984).Google Scholar
  19. [19]
    Shepherdson, J.C. “Negation as Failure: a Comparison of Clark's Completed Data Bases and Reiter's Closed World Assumption”. Journal of Logic Programming, 1,1 (1984) 51–79.Google Scholar
  20. [20]
    Shepherdson, J.C. “Negation as Failure II”. Journal of Logic Programming, 2,3 (1985) 185–202.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Roberto Barbuti
    • 1
  • Paolo Mancarella
    • 1
  • Dino Pedreschi
    • 1
  • Franco Turini
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations