Reasoning in systems of equations and inequations

  • Chilukuri K. Mohan
  • Mandayam K. Srivas
  • Deepak Kapur
Session 6 Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)


Reasoning in purely equational systems has been studied quite extensively in recent years. Equational reasoning has been applied to several interesting problems, such as, development of equational programming languages, automating induction proofs, and theorem proving. However, reasoning in the presence of explicit inequations is still not as well understood. The expressive power of equational languages will be greatly enhanced if one is allowed to state inequations of terms explicitly. In this paper, we study reasoning in systems which consist of equations as well as inequations, emphasizing the development of forward, i.e., non-refutational, techniques for deducing valid inequations, similar to those for equational inference. Such techniques can be used as a basis for developing execution strategies for equational and declarative languages. We develop an inference system and show that it is complete for deducing all valid inequations. The inference system is used to develop a goal-directed semi-decision procedure which uses a narrowing technique for proving inequations. This semi-decision procedure can be converted into a decision procedure when certain additional conditions are satisfied.


Inference System Inference Rule Decision Procedure Theorem Prove Equational Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BeKl86]
    J.A.Bergstra, J.W.Klop, Conditional Rewrite Rules: Confluence and Termination, Journal of Computer & System Sciences 32, No.3, June 1986.Google Scholar
  2. [Birk35]
    G. Birkhoff, On the Structure of Abstract Algebras, Proc. Cambridge Philos. Soc. 31, 433–454, 1935.Google Scholar
  3. [ChLe73]
    C.L. Chang, R.C. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.Google Scholar
  4. [Colm84]
    A. Colmerauer, Equations and Inequations on Finite and Infinite Trees, Proc. Intl. Conf. on Fifth Generation Computer Systems, ICOT, Japan, 1984.Google Scholar
  5. [Como86]
    H.Comon, Sufficient Completeness, Term Rewriting Systems, and ‘Anti-Unification', Eighth Conference on Automated Deduction, Oxford, LNCS 230, Springer Verlag, July 1986.Google Scholar
  6. [HoOd82]
    C.M. Hoffman, M.J. O'Donnel, Programming with equations, ACM TOPLAS, Vol. 4, No. 1, 83–112, 1982.CrossRefGoogle Scholar
  7. [HsDe83]
    J.Hsiang, N.Dershowitz, Rewrite Methods for Clausal and Nonclausal Theorem Proving, Proc. 10th ICALP, July 1983.Google Scholar
  8. [HsRu86]
    J. Hsiang, M. Rusinowitch, On Word Problems in Equational Theories, Computer Science Dept., SUNY at Stony Brook, New York, Aug. 1986 (also in Proc. 14th ICALP, Karlsruhe, July 1987).Google Scholar
  9. [HuHu80]
    G.Huet, J.M.Hullot, Proofs by Induction in Equational Theories with Constructors, Proc. 21st FOCS, 96–107, 1980.Google Scholar
  10. [Hull80]
    J.M.Hullot, Canonical Forms and Unification, Proc. 5th CADE, LNCS 87, Springer Verlag, also Tech.Rep. CSL-114, SRI Int'l, April 1980.Google Scholar
  11. [JoKo86]
    J.-P.Jouannaud, E.Kounalis, Proofs by induction in equational theories without constructors, Proc. of Logic in Computer Science Conference, Cambridge, MA, June 1986.Google Scholar
  12. [KaMu87]
    D.Kapur, D.Musser, Proof by Consistency, Artificial Intelligence 31, Feb. 1987.Google Scholar
  13. [KaNZ86]
    D.Kapur, P.Narendran, H.Zhang, Proof by induction using test sets, Proc. of CADE-8, Oxford, England, July 1986.Google Scholar
  14. [Kapl83]
    S. Kaplan, Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence, Rapport de Recherche, No. 194, Universite de Paris-Sud, Orsay, France, Dec. 1983.Google Scholar
  15. [KaNa84]
    D. Kapur, P. Narendran, An equational Approach to Theorem Proving in FOPC, Technical Report, GE Corp. Res. and Dev. Center, Schenectady, NY 12345, April 1984.Google Scholar
  16. [KaNO87]
    D. Kapur, P. Narendran, F. Otto, On Ground Confluence of Term Rewriting Systems, Technical Report 87-06, GE Corp. Res. and Dev. Center, Schenectady, NY 12345, 1987.Google Scholar
  17. [KiLe87]
    C.Kirchner, P.Lescanne, Solving Disequations, Proc. 2nd IEEE Symp. on Logic in Computer Science, 1987.Google Scholar
  18. [KnBe70]
    D.E. Knuth, P.B. Bendix, Simple word problems in Universal Algebras, in J. Leech, Ed., Computational Problems in Abstract Algebras, Pergamon, 1970.Google Scholar
  19. [LaMM86]
    J-L. Lassez, M.J. Maher, K. Marriott, Unification Revisited, IBM T.J.Watson Research Center, Yorktown Heights, New York, USA, 1986.Google Scholar
  20. [Lank75]
    D.S.Lankford, Canonical Inference, Report ATP-32, Dept. of Math. and Comp. Sci., Univ. of Texas at Austin, Dec. 1975.Google Scholar
  21. [MoSK87]
    C.K. Mohan, M.K. Srivas, D. Kapur, On Proofs in Systems of Equations and Inequations, Tech.Rep.87/02, Computer Science Dept., SUNY at StonyBrook, New York, Jan.1987.Google Scholar
  22. [MoSr86]
    C.K.Mohan M.K.Srivas, Function Definitions in Term Rewriting and Applicative Programming, Information and Control, Vol.71, No.3, Academic Press, Dec.1986.Google Scholar
  23. [MoSr87]
    C.K. Mohan, M.K. Srivas, Conditional Specifications Using Inequality Assumptions, First International Workshop on Conditional Term Rewriting Systems, Univ. of Paris-Sud, Orsay, France, July 1987.Google Scholar
  24. [Muss79]
    D.R.Musser, Abstract Data Type Specification in the AFFIRM System, Specifications of Reliable Software Conference, Boston, April 1979.Google Scholar
  25. [Muss80]
    D.R.Musser, On Proving Inductive Properties of Abstract Data Types, Proc. 7th POPL, Las Vegas, 1980.Google Scholar
  26. [Selm72]
    A. Selman, Completeness of Calculii for Axiomatically Defined classes of Algebras, Algebra Universalis, Vol.2, 20–32, 1972.Google Scholar
  27. [WoMc86]
    L.Wos, W.McCune, Negative Paramodulation, Eighth Conference on Automated Deduction, Oxford, England, July 1986.Google Scholar
  28. [ZhRe85]
    H.Zhang, J.L.Remy, Contextual Rewriting, First Conference on Rewriting Techniques and Applications, Dijon, France, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Chilukuri K. Mohan
    • 1
  • Mandayam K. Srivas
    • 1
  • Deepak Kapur
    • 2
  1. 1.Computer Science DepartmentState University of New YorkStony BrookUSA
  2. 2.General Electric Co.Corporate Research and DevelopmentSchenectadyUSA

Personalised recommendations