Advertisement

Constructive negation using typed existence properties

  • John G. Cleary
  • Lunjin Lu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1490)

Abstract

A method for extracting positive information from negative goals is proposed. The method makes use of knowledge about the existence of solutions of predicates and about the types of variables. It strictly generalises earlier work in this area. It can be used as a construction rule or as a simplification rule. As a construction rule it does not involve an SLD-derivation of the negated sub-goal and so is applicable during compilation. As a simplification rule it prunes unsatisfiable goals without doing an explicit satisfiability test.

Keywords

constructive negation existence properties type system 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Aiken and E. Wimmers. Solving Systems of Set Constraints. In Proceedings of the Seventh IEEE Symposium on Logic in Computer Science, pages 329–340. The IEEE Computer Society Press, 1992.Google Scholar
  2. 2.
    D. Chan. Constructive Negation Based on the Completed Database. In R. A. Kowalski and K. A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 111–125. The MIT Press, 1988.Google Scholar
  3. 3.
    D. Chan. An Extension of Constructive Negation and its Application in Coroutining. In Ewing L. Lusk and Ross A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 477–496, 1989.Google Scholar
  4. 4.
    J.G. Cleary. Constructive Negation of Arithmetic Constraints Using Data-Flow Graphs. Constraints, 2: 131–162, 1997.MATHCrossRefGoogle Scholar
  5. 5.
    P. Cousot and R. Cousot. Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming, 13(1, 2, 3 and 4):103–179, 1992.MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    P.W. Dart and J. Zobel. Efficient Run-Time Type Checking of Typed Logic Programs. Journal of Logic Programming, 14(1–2):31–69, 1992.MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    W. Drabent. What Is Failure? An Approach to Constructive Negation. Acta Informatica, 32:27–59, 1995.MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    F. Fages. Constructive Negation by Pruning. Journal of Logic Programming, 32(2):85–118, 1997.MATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    N. Foo, A. Rao, A. Taylor, and A. Walker. Deduced Relevant Types and Constructive Negation. In R.A. Kowalski and K.A. Bowen, editors, Proceedings of the fifth International Conference and Symposium on Logic Programming, pages 126–139. The MIT Press, 1988.Google Scholar
  10. 10.
    T. Fruhwirth, E. Shapiro, M.Y. Vardi, and E. Yardeni. Logic Programs as Types for Logic Programs. In Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, pages 300–309. The IEEE Computer Society Press, 1991.Google Scholar
  11. 11.
    F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, 1984.Google Scholar
  12. 12.
    M. Kifer and J. Wu. A First-Order Theory of Types and Polymorphism in Logic Programming. In Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, pages 310–321. The IEEE Computer Society Press, 1991.Google Scholar
  13. 13.
    J. Małuszyński and T. Näslund. Fail Substitutions for Negation as Failure. In Ewing L. Lusk and Ross A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 461–476. The MIT Press, 1989.Google Scholar
  14. 14.
    P. Mishra. Towards a Theory of Types in Prolog. In Proceedings of the IEEE international Symposium on Logic Programming, pages 289–298. The IEEE Computer Society Press, 1984.Google Scholar
  15. 15.
    A. Mycroft and R.A. O'Keefe. A Polymorphic Type System for Prolog. Artificial Intelligence, 23:295–307, 1984.MATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    Frank Pfenning, editor. Types in Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.Google Scholar
  17. 17.
    P.J. Stuckey. Negation and Constraint Logic Programming. Information and Computation, 118:12–33, 1995.MATHMathSciNetCrossRefGoogle Scholar
  18. 18.
    J. Tiuryn. Type Inference Problems: A Survey. In B. Roven, editor, Proceedings of the Fifteenth International Symposium on Mathematical Foundations of Computer Science, pages 105–120. Springer-Verlag, 1990.Google Scholar
  19. 19.
    E. Yardeni and E. Shapiro. A Type System for Logic Programs. Journal of Logic Programming, 10(2).125–153, 1991.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • John G. Cleary
    • 1
  • Lunjin Lu
    • 1
  1. 1.Department of Computer ScienceUniversity of WaikatoHamiltonNew Zealand

Personalised recommendations