Skip to main content
SpringerLink
Log in

Efficient compilation of first order predicates

  • Short Papers
  • Conference paper
  • First Online:
Trends in Artificial Intelligence (AI*IA 1991)

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

Included in the following conference series:

  • 120 Accesses

Abstract

We have developed a theorem prover for the full first order logic, by compiling clauses into proof procedures. These procedures exploit a set of abstract machine primitives for full unification and primitives which provide completeness and soundness for the proof procedure. These primitives are part of a Common Runtime Support which enables mixing code from various high level languages. Our theorem prover can thus be used as a component in a larger application, which may be written in any mixture of C, Lisp and Prolog. We show first how to compile Horn clauses along the lines of Prolog. A full first-order logic theorem prover is then produced by compiling predicates into code which uses full unification, a complete search strategy and a complete inference procedure.

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. G. Attardi, M. Gaspari, F. Saracco, Interoperability of AI Languages, Proocedings of 9th European Conference on Artificial Intelligence, 1990, 41–46.

    Google Scholar 

  2. G. Attardi, M. Gaspari, Multilanguage Interoperability, Third International Symposium on Programming Language Implementation and Logic Programming, Passau, 1991.

    Google Scholar 

  3. D. W. Loveland, A simplified format for the model elimination procedure, J. ACM, 16(3), 1969, 349–363.

    Google Scholar 

  4. M.E. Stickel, A Prolog technology theorem prover: implementation by an extended Prolog compiler, J. of Automated Reasoning, 4(4), 1988, 353–380.

    Google Scholar 

  5. M.E. Stickel, A Prolog technology theorem prover: a new exposition and implementation in Prolog, in Design and Implementation of Symbolic Computation Systems, Lecture Notes in Computer Science 429 1990, 154–163.

    Google Scholar 

  6. D.H.D. Warren, An abstract Prolog instruction set, Tech. Note 309, SRI International, Menlo Park, Oct. 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Corso Italia 40, I-56125, Pisa, Italy

    Giuseppe Attardi, Mauro Gaspari & Pietro Iglio

Authors
  1. Giuseppe Attardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mauro Gaspari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pietro Iglio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edoardo Ardizzone Salvatore Gaglio Filippo Sorbello

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Attardi, G., Gaspari, M., Iglio, P. (1991). Efficient compilation of first order predicates. In: Ardizzone, E., Gaglio, S., Sorbello, F. (eds) Trends in Artificial Intelligence. AI*IA 1991. Lecture Notes in Computer Science, vol 549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54712-6_258

Download citation

  • DOI: https://doi.org/10.1007/3-540-54712-6_258

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54712-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation