Skip to main content

Advanced topics in automated deduction

  • Conference paper
  • First Online:
Advanced Topics in Artificial Intelligence (ACAI 1987)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bancilhon and R. Ramakrishnan. An amateur's introduction to recursive query processing strategies. In Proc. SIGMOD Conf. on Management of Data, pages 16–52, ACM, 1986.

    Google Scholar 

  2. W. Bibel. An approach to a systematic theorem proving procedure in first-order logic. Computing, 12:43–55, 1974.

    Google Scholar 

  3. W. Bibel. Automated Theorem Proving. Vieweg Verlag, second, 289 pages edition, 1987.

    Google Scholar 

  4. W. Bibel. Constraint Satisfaction from a Deductive Viewpoint. Technical Report, Forschungsgruppe Künstliche Intelligenz, Technische Universität München, 1987 (submitted).

    Google Scholar 

  5. W. Bibel. Methods of automated reasoning. In W. Bibel and Ph. Jorrand, editors, Fundamentals of Artificial Intelligence — An Advanced Course, pages 173–222, Springer, LNCS 232, Berlin, 1986.

    Google Scholar 

  6. W. Bibel. On matrices with connections. Journal of ACM, 28:633–645, 1981.

    Google Scholar 

  7. W. Bibel. Prädikatives Programmieren. In GI — 2. Fachtagung über Automatentheorie und Formale Sprachen, pages 274–283, Springer, Berlin, 1975.

    Google Scholar 

  8. W. Bibel. Predicative programming revisited. In W. Bibel and K. Jantke, editors, MMSSSS'85 — Mathematical Methods for the Specification and Synthesis of Software Systems, pages 24–40, Springer, Berlin, 1986.

    Google Scholar 

  9. W. Bibel. Programmieren in der Sprache der Prädikatenlogik. (Rejected) thesis for “Habilitation” presented to the Faculty of Mathematics, Technische Universität München, January 1975.

    Google Scholar 

  10. W. Bibel. A Uniform Approach to Programming. Bericht 7633, Technische Universität München, Mathematische Fakultät, 1976.

    Google Scholar 

  11. W. Bibel and Ph. Jorrand, editors. Fundamentals of Artificial Intelligence. Study Edition, Springer, Berlin, 1987.

    Google Scholar 

  12. W. Bibel, R. Letz, and J. Schumann. Bottom-up enhancements of deductive systems. In I. Plander, editor, Proceedings of 4th International Conference on Artificial Intelligence and Information-Control Systems of Robots, North-Holland, Smolenice, CSSR, October 1987.

    Google Scholar 

  13. W. S. Brainerd and L. H. Landweber. Theory of Computation. Wiley, New York, 1974.

    Google Scholar 

  14. M. Breu. Einbeziehung einfacher Induktionsbeweise in den Konnektionenkalkül. Diplomthesis, Technische Universität München, 1986.

    Google Scholar 

  15. E. Eder. Properties of substitutions and unifications. Journal for Symbolic Computation, 1:31–46, 1985.

    Google Scholar 

  16. C. Green. Theorem proving by resolution as a basis for question-answering systems. In B. Meltzer and D. Michie, editors, Machine Intelligence 4, Edinburgh University Press, 1969.

    Google Scholar 

  17. L. J. Henschen and S. A. Naqvi. On compiling queries in recursive first-order databases. Journal of ACM, 31:47–85, 1984.

    Google Scholar 

  18. G. Huet. Deduction and computation. In W. Bibel and Ph. Jorrand, editors, Fundamentals of Artificial Intelligence — An Advanced Course, pages 39–74, Springer, LNCS 232, Berlin, 1987.

    Google Scholar 

  19. J. Minker, D. H. Fishman, and J. R. McSkimin. The Q* algorithm — a search strategy for a deductive question-answering system. Artificial Intelligence, 4:225–243, 1973.

    Google Scholar 

  20. K. Morris, J. D. Ullman, and A. van Gelder. Design overview of the NAIL! system. In E. Shapiro, editor, Proc. 3rd Intern. Conf. on Logic Programming, pages 554–568, Springer (LNCS 225), Berlin, 1986.

    Google Scholar 

  21. F. J. Pelletier and P. Rudnicki. Non-obviousness. AAR Newsletter, 6:4–5, 1987.

    Google Scholar 

  22. R. Reiter. Towards a logical reconstruction of relational database theory. In M. L. Brodie et al., editor, On Conceptual Modeling, pages 191–238, Springer, Berlin, 1983.

    Google Scholar 

  23. L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, Cambridge MA, 1986.

    Google Scholar 

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

    Google Scholar 

  25. J. D. Ullman. Principles of Database Systems. Computer Science Press, Rockville MD, 1982.

    Google Scholar 

  26. L. Wallen. Automated Deduction in Modal Logics. PhD thesis, University of Edinburgh, 1987. PhD Thesis.

    Google Scholar 

  27. L. Wallen. Matrix proof methods for modal logics. In IJCAI'87, pages 917–923, Morgan Kaufmann, Los Altos CA, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rolf T. Nossum

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bibel, W. (1988). Advanced topics in automated deduction. In: Nossum, R.T. (eds) Advanced Topics in Artificial Intelligence. ACAI 1987. Lecture Notes in Computer Science, vol 345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50676-4_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-50676-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50676-8

  • Online ISBN: 978-3-540-46068-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics