Skip to main content
SpringerLink
Log in
Book cover

GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung pp 277–288Cite as

Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine

  • Conference paper

Part of the book series: Informatik-Fachberichte ((2252,volume 124))

Abstract:

A method to incorporate T-unification in the Warren Abstract Prolog Machine is presented. It is based on the concept of lazy-unification, that is unification, where only the theory free part of terms is unified, while the T-part is added to the resolvent and solved later on. Soundness and completeness of the corresponding lazy SLD-resolution strategy is shown.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Beer J. [ 1985 ]: Comments on Compiling Prolog Program’s Using Warren’s Abstract Prolog Instruction Set; PIPE-Report, GMD-FIRST, Berlin

    Google Scholar 

  • Birkhoff G. [ 1935 ]: On the Structure of Abstract Algebra; Proc. Cambr. Philos. Soc. 31

    Google Scholar 

  • Bläsius K.H. [19861: Construction of Equality Graphs; SEKI-Report, Universität Kaiserslautern

    Google Scholar 

  • Book R., Siekmann J. [ 1984 ]: On the Unification Hierarchy; SEKT-Memo, Universität Kaiserslautern

    Google Scholar 

  • Bundy A. [1983]: The Computer Modelling of Mathematical Reasoning; Academic Press, London

    MATH  Google Scholar 

  • Bürckert H.-J. [ 1985 ]: Extending the Warren Abstract Machine to Many-sorted Prolog; SEKI-Memo, Universität Kaiserslautern

    Google Scholar 

  • Bürckert H.-J. [ 1986 ]: Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine; SEKI-Report, Universität Kaiserslautern, to appear

    Google Scholar 

  • Bürckert H.-J., Herold A. 1986 ]: On Certain Classes of Equational Theories; SEM-Report, Universität Kaiserslautern, to appear

    Google Scholar 

  • Chang C.-L., Lee R.C.-T. [ 1973 ]: Symbolic Logic and Mechanical Theorem Proving; Academic Press, New•York–London

    MATH  Google Scholar 

  • Clark K.L. [ 1979 ]: Predicate Logic as a Computational Formalism; Research Report, Imperial College London

    Google Scholar 

  • Clocksin W.F., Mellish C.S. [ 1981 ]: Programming in Prolog; Springer, Berlin - Heidelberg - New York

    MATH  Google Scholar 

  • Digricoli V.J. [ 1979 ]: Resolution by Unification and Equality; Proc. 4th Workshop on Automated Deduction, Texas

    Google Scholar 

  • Fages F., Huet G. [ 1983 ]: Complete Set of Unifiers and Matchers in Equational Theories; Proc. of CAAP83, Springer Lec. Notes Comp. Sci 159

    Google Scholar 

  • Furbach U., Hólldobler S. [ 1985 ]: Modelling the Combination of Functional and Logic Programming Languages; Int. Report, Universität der Bundeswehr, München

    Google Scholar 

  • Gabriel J., Lindholm T., Lusk E.L., Overbeek R.A. [ 1984 ]: A Tutorial on the Warren Abstract Machine for Computational Logic; Argonne National Laboratory, Argonne

    Google Scholar 

  • Hill R. [ 1974 ]: LUSH-Resolution and its Completeness; DCL Memo, University of Edinburgh

    Google Scholar 

  • Huet G. [1972]: Constraint Resolution: A Complete Method for Higher Order Logic; Thesis, Case Western Reserve University

    Google Scholar 

  • Huet G., Oppen D.C. [ 1980 ]: Equations and Rewrite Rules (Survey); SRI Technical Report, Stanford

    Google Scholar 

  • Jaffar,J., Lassez,J.L., Maher•MJ. [ 1986 ]: Logic Programming Language Scheme, in Logic Programming: Functions, Relations, Equations (ed. DeGroot D., Lindstrom G.); Prentice Hall, New Jersey

    Google Scholar 

  • Kowalski R. [1979]: Logic for Problem Solving; North Holland, Amsterdam - New York - Oxford

    Google Scholar 

  • Lloyd J.W. [1984]: Foundations of Logic Programming; Springer, Berlin - Heidelberg - New York - Tokyo

    Google Scholar 

  • Loveland D. [ 1978 ]: Automated Theorem Proving; North Holland, Amsterdam - New York - Oxford

    Google Scholar 

  • Ohlbach H.J. [ 1986 ]: The Semantic Clause Graph Calculus - An Overview; SEKJ-Report, Universität Kaiserslautern, to appear

    Google Scholar 

  • Plotkin G. [1972]: Building in Equational Theories; Machine Intelligence 7

    Google Scholar 

  • Schmidt-Schaull M. [1986]: Unification under Associativity and Idempotence is of Type Nullary; to appear in Journal of Automated Reasoning

    Google Scholar 

  • Siekmann J. [ 1984 ]: Universal Unification (Survey); Proc. 7th CADE, Los Angeles

    Google Scholar 

  • Siekmann J. [ 1986 ]: Unification Theory; Proc. 7th ECAI, Brighton, to appear

    Google Scholar 

  • Szabo P. [ 1982 ]: Unifikationstheorie Erster Ordnung (in German); Dissertation, Universität Karlsruhe

    Google Scholar 

  • Walther C. [ 1984 ]: Unification in Many-Sorted Theories; Dissertation, Universität Karlsruhe

    Google Scholar 

  • Warren D.H.D. [ 1977 ]: Compiling Predicate Logic Programs; DAI Research Report, University of Edinburgh

    Google Scholar 

  • Warren D.H.D. [ 1983 ]: An Abstract Prolog Instruction Set; SRI Technical Note, Stanford

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, D-6750, Kaiserslautern, W. Germany

    Hans-Jürgen Bitrckert

Authors
  1. Hans-Jürgen Bitrckert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM Deutschland GmbH, Abt. LILOG 3504, Postfach 800880, D-7000, Stuttgart 80, Germany

    Claus-Rainer Rollinger

  2. Institut für Medizinische Kybernetik und Artificial Intelligence, Universität Wien, Freyung 6, A-1010, Wien, Austria

    Werner Horn

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bitrckert, HJ. (1986). Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine. In: Rollinger, CR., Horn, W. (eds) GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-71385-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-71385-9_28

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-71385-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation