Skip to main content
Log in

The problem of reasoning from inequalities

  • Basic Research Problem
  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This article is the twenty-first of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find an inference rule that performs as paramodulation does, but with the focus on inequalities rather than on equalities. Since, too often, inequalities that are present in the input play a passive role during a reasoning program's attempt to complete an assignment, such an inference rule would markedly add to program effectiveness by giving inequalities the potential of playing a key role. For evaluating a proposed solution to this research problem, we suggest as possible test problems theorems from group theory and theorems from ring theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bledsoe, W., ‘A new method for proving certain Presburger formulas’, inProceedings of the Fourth IJCAI, Tbilisi, U.S.S.R. (1975), pp. 15–21.

  2. BledsoeW., ‘Some proofs in analysis’, inContemporary Mathematics, Vol. 29, Automated Theorem Proving: After 25 Years, ed. W.Bledsoe and D.Loveland, American Mathematical Society, Providence, Rhode Island (1984), pp. 89–118.

    Google Scholar 

  3. BledsoeW., and HinesL. M., ‘Variable elimination and chaining in a resolution-based prover for inequalities’, inProceedings of the Fifth International Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, Vol. 87, ed. W.Bibel and R.Kowalski, Springer-Verlag, New York (1980), pp. 70–87.

    Google Scholar 

  4. BledsoeW., KunenK., and ShostakR., ‘Completeness results for inequality provers’,Artificial Intelligence 27, 255–288 (1985).

    Article  MathSciNet  Google Scholar 

  5. Digricoli, V., ‘The efficiency of RUE resolution, experimental results and heuristic theory’ inProceedings of the Seventh International Joint Conference on Artificial Intelligence, University of British Columbia, Vancouver (1981), pp. 539–547.

  6. MannaZ., and WaldingerR., ‘Special relations in automated deduction’,J. ACM 33, 1–59 (1986).

    Article  MathSciNet  Google Scholar 

  7. RobinsonG., and WosL., ‘Paramodulation and theorem-proving in first-order theories with equality’ inMachine Intelligence 4, ed. B.Meltzer and D.Michie, Edinburgh University Press, Edinburgh (1969), pp. 135–150.

    Google Scholar 

  8. RobinsonJ. ‘A machine-oriented logic based on the resolution principle’,J. ACM 12, 23–41 (1965).

    Article  MATH  Google Scholar 

  9. RobinsonJ., ‘Automatic deduction with hyper-resolution’,Inter. J. Computer Mathematics 1, 227–234 (1965).

    MATH  Google Scholar 

  10. WosL.,Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1988).

    Google Scholar 

  11. WosL., and McCuneW., ‘Negative hyperparamodulation’, inProceedings of the Eighth International Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, Vol. 230, ed. J.Siekmann, New York, Springer-Verlag (1986), pp. 229–239.

    Google Scholar 

  12. WosL., OverbeekR., LuskE., and BoyleJ.,Automated Reasoning: Introduction and Applications, 2nd ed., McGraw-Hill, New York (1992).

    Google Scholar 

  13. WosL., and RobinsonG., ‘Maximal models and refutation completeness: Semidecision procedures in automatic theorem proving’, inWord Problems: Decision Problems and the Burnside Problem in Group Theory, ed. W.Boone, F.Cannonito, and R.Lyndon, North-Holland, New York (1973), pp. 609–639.

    Google Scholar 

  14. WosL., RobinsonG., CarsonD., and ShallaL., ‘The concept of demodulation in theorem proving’,J. ACM 14, 698–709 (1967), inProceedings of the Eighth International Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, Vol. 230, ed. J.Siekmann, Springer-Verlag, New York (1986), pp. 229–239.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-13-109-Eng-38.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wos, L. The problem of reasoning from inequalities. J Autom Reasoning 8, 421–426 (1992). https://doi.org/10.1007/BF02341857

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02341857

Key words

Navigation