Skip to main content
Springer Nature Link
Log in

Towards first-order deduction based on Shannon graphs

  • Technical Papers
  • Conference paper
  • First Online:
GWAI-92: Advances in Artificial Intelligence

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

Abstract

We present a new approach to Automated Deduction based on the concept of Shannon graphs, which are also known as Binary Decision Diagrams (BDDs). A Skoleinized formula is first transformed into a Shannon graph, then the latter is compiled into a set of Horn clauses. These can finally be run as a Prolog program trying to refute the initial formula. It is also possible to precompile axiomatizations into Prolog and load these theories as required.

This paper was published in Proc. German Workshop on Artificial Intelligence 1992, Springer Verlag.

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.

References

  1. Karl S. Brace, Richard L. Rudell, & Randal E. Bryant. Efficient implementation of a BDD package. In Proc. 27 th ACM/IEEE Design Automation Conference, pages 40–45. IEEE Press, 1990.

    Google Scholar 

  2. Randal Y. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677–691, 1986.

    Google Scholar 

  3. A. Kemper, G. Moerkotte, & M. Steinbrunn. Optimization of boolean expressions in object bases. In Proc. Intern. Conf. on Very Large Databases, 1992.

    Google Scholar 

  4. T. Kropf & H.-J. Wunderlich. A common approach to test generation and hardware verification based on temporal logic. In Proc. Intern. Test Conf., pages 57–66, Nashville, TN, October 1991.

    Google Scholar 

  5. C. Lee. Representation of switching circuits by binary decision diagrams. Bell System Technical Journal, 38:985–999, 1959.

    Google Scholar 

  6. Ewa Orlowska. Automatic theorem proving in a certain class of formulae of predicate calculus. Bull. de L'Acad. Pol. des Sci., Série des sci. math., astr. et phys., XVII(3):117–119, 1969.

    Google Scholar 

  7. Joachim Posegga. First-order shannon graphs. In Proc. Workshop on Automated Deduction / Intern. Conf. on Fifth Generation Computer Systems, ICOT TM-1184, Tokyo, Japan, June 1992.

    Google Scholar 

  8. C. E. Shannon. A symbolic analysis of relay and switching circuits. AIEE Transactions, 67:713–723, 1938.

    Google Scholar 

  9. Mark E. Stickel. A Prolog Technology Theorem Prover. In E. Lusk & R. Overbeek, editors, 9th International Conference on Automated Deduction, Argonne, Ill., May 1988. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, Am Fasanengarten 5, 7500, Karlsruhe, Germany

    Joachim Posegga & Bertram Ludäscher

Authors
  1. Joachim Posegga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bertram Ludäscher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Jürgen Ohlbach

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Posegga, J., Ludäscher, B. (1993). Towards first-order deduction based on Shannon graphs. In: Jürgen Ohlbach, H. (eds) GWAI-92: Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018993

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56667-0

  • Online ISBN: 978-3-540-47626-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics