Skip to main content

ACE: The abstract clause engine

  • Conference paper
  • First Online:
Book cover 10th International Conference on Automated Deduction (CADE 1990)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 449))

Included in the following conference series:

  • 160 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. R.M. Haralick and G.L. Elliott, Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intelligence 14 (1980) 263–313.

    Google Scholar 

  2. R.E. Korf, Depth-First Iterative-Deepening: An Optimal Admissible Tree Search, Artificial Intelligence 27 (1985) 97–109.

    Google Scholar 

  3. P.W. Purdom, Jr., Search Rearrangement Backtracking and Polynomial Average Time, Artificial Intelligence 21 (1983) 117–133.

    Google Scholar 

  4. D.A. Wolfram, Forward Checking and Intelligent Backtracking, Information Processing Letters 32 (1989) 85–87.

    Google Scholar 

  5. D.A. Wolfram, Intractable Unifiability Problems and Backtracking, Journal of Automated Reasoning 5 (1989) 37–47.

    Google Scholar 

  6. D.A. Wolfram, Reducing Thrashing by Adaptive Backtracking, University of Cambridge Computer Laboratory, Technical Report 112, August, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mark E. Stickel

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolfram, D.A. (1990). ACE: The abstract clause engine. In: Stickel, M.E. (eds) 10th International Conference on Automated Deduction. CADE 1990. Lecture Notes in Computer Science, vol 449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52885-7_139

Download citation

  • DOI: https://doi.org/10.1007/3-540-52885-7_139

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52885-2

  • Online ISBN: 978-3-540-47171-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics