Skip to main content
Springer Nature Link
Log in

CHCL — A connectionist inference system

  • Conference paper
  • First Online:
Parallelization in Inference Systems

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

Abstract

Chcl is a Connectionist inference system for Horn logic which is based on the Connection method and uses Limited resources. This paper gives an overview of the system and its implementation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation, and Compiling, volume I: Parsing. Prentice-Hall, Englewood Cliffs, N. J., 1972.

    Google Scholar 

  2. D. H. Ballard. Parallel logic inference and energy minimization. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 203–208, 1986.

    Google Scholar 

  3. [Bibel et al., 1991] W. Bibel, S. Hölldobler, and J. Würtz. Cycle unification. Technical Report AIDA-91-15, FG Intellektik, FB Informatik, TH Darmstadt, 1991.

    Google Scholar 

  4. W. Bibel. Automated Theorem Proving, Vieweg Verlag, Braunschweig, second edition, 1987.

    Google Scholar 

  5. W. Bibel. Advanced topics in automated deduction. In Nossum, editor, Fundamentals of Artificial Intelligence II. Springer, 1988.

    Google Scholar 

  6. A. Colmerauer. Prolog and infinite trees. In Clark and Tarnlund, editors, Logic Programming, pages 231–251. Academic Press, 1982.

    Google Scholar 

  7. P. R. Cooper and M. J. Swain. Parallelism and domain dependence in constraint satisfaction. Technical Report 255, Computer Science Department, Univ. of Rochester, 1988.

    Google Scholar 

  8. J. Diederich. Connectionist recruitment learning. In Proceedings of the European Conference on Artificial Intelligence, pages 351–356, 1988.

    Google Scholar 

  9. W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1984.

    Google Scholar 

  10. [Dwork et al., 1984] C. Dwork, P. C. Kannelakis, and J. C. Mitchell. On the sequential nature of unification. Journal of Logic Programming, 1:35–50, 1984.

    Google Scholar 

  11. J. L. Elman. Structured representations and connectionist models. In Proceedings of the Annual Conference of the Cognitive Science Society, pages 17–25, 1989.

    Google Scholar 

  12. J. A. Feldman and D. H. Ballard. Connectionist models and their properties. Cognitive Science, 6(3):205–254, 1982.

    Google Scholar 

  13. [Feldman et al., 1990] J. A. Feldman, G. Lakoff, A. Stolcke, and S. H. Weber. Miniature language acquisition: A touchstone for cognitive science. In Proceedings of the Annual Conference of the Cognitive Science Society, pages 686–693, 1990.

    Google Scholar 

  14. J. A. Feldman. Dynamic connections in neural networks. Biological Cybernetics, 46:27–39, 1982.

    Google Scholar 

  15. H.-W. Güsgen and S. Hölldobler. Connectionist inference systems. In B. Fronhöfer and G. Wrightson, editors, Parallelization in Inference Systems. Springer, 1991.

    Google Scholar 

  16. H. W. Güsgen. A connectionist approach to symbolic constraint satisfaction. Technical Report TR-90-018, International Computer Science Institute, Berkeley, CA, 1990.

    Google Scholar 

  17. S. Hölldobler and W. Hower. Constraint satisfaction in a connectionist inference system. In Proceedings of the 4th International Symposium on Artificial Intelligence, pages 215–221, 1991.

    Google Scholar 

  18. S. Hölldobler. CHCL — A connectionist inference system for a limited class of Horn clauses based on the connection method. Technical Report TR-90-042, International Computer Science Institute, Berkeley, CA, 1990.

    Google Scholar 

  19. S. Hölldobler. A structured connectionist unification algorithm. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 587–593, 1990. A long version appeared as Technical Report TR-90-012, International Computer Science Institute, Berkeley, California.

    Google Scholar 

  20. M. I. Jordan. Attractor dynamics and parallelism in a connectionist sequential machine. In Proceedings of the Annual Conference of the Cognitive Science Society, 1986.

    Google Scholar 

  21. F. Kurfeß. Unification on a connectionist simulator. In Proceedings of the International Conference on Artificial Neural Networks, 1991. ICSI.

    Google Scholar 

  22. F. Kurfeß. Unification with Icsim. Technical report, International Computer Science Institute, Berkeley, CA, 1991.

    Google Scholar 

  23. A. Mackworth. Constraint satisfaction. In Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 205–211. John Wiley & Sons, 1987.

    Google Scholar 

  24. B. Meyer. Object-Oriented Software Construction. Prentice Hall, 1988.

    Google Scholar 

  25. N. Morgan. The ring array processor (RAP): Algorithms and architecture. Technical Report TR-90-47, International Computer Science Institute, Berkeley, CA, 1990.

    Google Scholar 

  26. S. Omohundro. Differences between Sather and Eiffel. Eiffel Outlook, 1991.

    Google Scholar 

  27. M. S. Paterson and M. N. Wegman. Linear unification. Journal of Computer and System Sciences, 16:158–167, 1978.

    Google Scholar 

  28. J. B. Pollack. Recursive auto-associative memory: Devising compositional distributed representations. In Proceedings of the Annual Conference of the Cognitive Science Society, 1988.

    Google Scholar 

  29. J. B. Pollack. Recursive distributed representations. Artificial Intelligence, 46:77–105, 1990.

    Google Scholar 

  30. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23–41, 1965.

    Google Scholar 

  31. H. W. Schmidt. ICSIM: Initial design of an object-oriented net simulator. Technical Report TR-90-055, International Computer Science Institute, Berkeley, CA, 1990.

    Google Scholar 

  32. [Schumann et al., 1989] J. Schumann, W. Ertel, and C. Suttner. Learning heuristics for a theorem prover using back propagation. In österreichische AI Tagung, 1989.

    Google Scholar 

  33. M. G. Scutella. A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability. Journal of Logic Programming, 8(265–273), 1990.

    Google Scholar 

  34. L. Shastri and V. Ajjanagadde. From associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings. Technical Report MS-CIS-90-05, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, School of Engineering and Applied Science, PA 19104-6389, 1990.

    Google Scholar 

  35. L. Shastri and V. Ajjanagadde. An optimally efficient limited inference system. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 563–570, 1990.

    Google Scholar 

  36. P. Smolensky. On variable binding and the representation of symbolic structures in connectionist systems. Technical Report CU-CS-355-87, Department of Computer Science & Institute of Cognitive Science, University of Colorado, Boulder, CO 80309-0430, 1987.

    Google Scholar 

  37. M. E. Stickel. An introduction to automated deduction. In W. Bibel and P. Jorrand, editors, Fundamentals of Artificial Intelligence, pages 75–132. Springer, 1987.

    Google Scholar 

  38. A. Stolcke and D. Wu. Tree matching with recursive distributed representations. International Computer Science Institute, Berkeley, CA, 1991. submitted to NIPS 91.

    Google Scholar 

  39. C. Suttner. Learning heuristics for automated theorem proving. Master's thesis, Institut für Informatik, Technische Universität München, 1989.

    Google Scholar 

  40. Thinking Machines Corporation. Connection Machine Model CM-2 Technical Summary. Technical Report HA87-4, 1987.

    Google Scholar 

  41. D. S. Touretzky and G. E. Hinton. A distributed connectionist production system. Cognitive Science, 12:423–466, 1988.

    Google Scholar 

  42. [Ultsch et al., 1990] A. Ultsch, R. Hannuschka, U. Hartmann, and V. Weber. Learning of control knowledge for symbolic proofs with backpropagation networks. In R. Eckmiller, G. Hartmann, and G. Hauske, editors, Parallel Processing in Neural Systems and Computers, pages 499–502. Elsevier, 1990.

    Google Scholar 

  43. S. H. Weber and A. Stolcke. L o: A testbed for miniature language aquisition. Technical Report TR-90-010, International Computer Science Institute, Berkeley, CA, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FG Intellektik, FB Informatik TH Darmstadt, Alexanderstraße 10, D-6100, Darmstadt, Germany

    Steffen Hölldobler

  2. International Computer Science Institute, 1947 Center Street Suite 600, 94704, Berkeley, CA, USA

    Franz Kurfeß

Authors
  1. Steffen Hölldobler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franz Kurfeß
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Fronhöfer G. Wrightson

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hölldobler, S., Kurfeß, F. (1992). CHCL — A connectionist inference system. In: Fronhöfer, B., Wrightson, G. (eds) Parallelization in Inference Systems. Lecture Notes in Computer Science, vol 590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55425-4_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-55425-4_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55425-7

  • Online ISBN: 978-3-540-47066-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics