[go: up one dir, main page]

Skip to main content
Log in

The problem of demodulating across argument and literal boundaries

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

Abstract

This article is the twenty-fourth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find an appropriate theory for modulating across argument and across literal boundaries. Because demodulation has proved so useful—is most cases, even crucial—to automated reasoning, extending this concept to permit canonicalization to be applied at the predicate and at the clause and subclause levels merits exploration. For evaluating a proposed solution to this research problem, we suggest problems from mathematics, logic, program verification, database inquiry, and the world of puzzles.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. BoyerR., LuskE., McCuneW., OverbeekR., StickelM., and WosL., ‘Set theory in first-order logic: Clauses for Gödel's axioms’, J. Automated Reasoning 2, 287–327 (1986).

    Google Scholar 

  2. KnuthD., and BendixP., ‘Simple word problems in universal algebras’, pp. 263–297 in Computational Problems in Abstract Algebra, ed. J.Leech, Pergamon Press, New York (1970).

    Google Scholar 

  3. McCharenJ., OverbeekR., and WosL., ‘Complexity and related enhancements for automated theorem-proving programs’, Computers and Mathematics with Applications 2, 1–16 (1976).

    Article  Google Scholar 

  4. WosL., RobinsonG., CarsonD., and ShallaL., ‘The concept of demodulation in theorem proving’, J. ACM 14, 698–709 (1967).

    Article  Google Scholar 

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

    Google Scholar 

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

    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-31-109-Eng-38.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wos, L. The problem of demodulating across argument and literal boundaries. Journal of Automated Reasoning 9, 407–408 (1992). https://doi.org/10.1007/BF00245299

Download citation

  • Received:

  • Issue Date:

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

Key words

Navigation