Abstract
This article is the twenty-third of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria for deciding which e1uality unit clauses to adjoin with regard to CPU time and may affect refutation completeness. For evaluating a proposed solution to this research problem, we suggest problems from mathematics, logic, circuit design, program verification, and the world of puzzles.
Similar content being viewed by others
References
Hsiang, J., ‘Refutational theorem proving using term-rewriting systems’, Artificial Intelligence 25, 255–300 (1985).
Knuth, D., and Bendix, P., ‘Simple word problems in universal algebras,’, pp. 263–297 in Computational Problems in Abstract Algebra, ed. J. Leech, Pergamon Press, New York (1970).
McCharen, J., Overbeek, R., and Wos, L., ‘Complexity and related enhancements for automated theorem-proving programs,’ Computers and Mathematics with Applications 2, 1–16 (1976).
Veroff, R., ‘Canonicalization and demodulation,’ Technical Report ANL-81–6, Argonne National Laboratory, Argonne, Ill. (1981).
Wos, L., Robinson, G., Carson, D., and Shalla, L., ‘The concept of demodulation in theorem proving’, J. ACM 14, 698–709 (1967).
Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1988).
Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, 2nd edn., McGraw-Hill, New York (1992).
Author information
Authors and Affiliations
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
Rights and permissions
About this article
Cite this article
Wos, L. The problem of demodulator adjunction. J Autom Reasoning 9, 289–290 (1992). https://doi.org/10.1007/BF00245464
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00245464