Skip to main content
SpringerLink
Log in
Book cover

GWAI-89 13th German Workshop on Artificial Intelligence pp 107–116Cite as

Linear Paramodulation modulo Equality

  • Conference paper

  • 114 Accesses

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

Abstract

We propose to use E-paramodulation, i.e. linear paramodulation modulo equality, to compute with generalized equational programs consisting of a conditional equational theory and a conditional equational program. Simple examples from deduction systems motivate our approach. We formally define the calculus for generalized equational programs which is based on the inference rules E-paramodulation and E-reflection. This calculus is proven to be sound and complete by using fixpoint theory. Finally, we discuss why the functional reflexive axioms have to be used to ensure these results.

A long version of this paper containing all the proofs is available as Forschungsbericht KI der TU München

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Avenhaus, J. Müller, M. Vierling: REPSY-REwrite Programm SYnthesis. Workshop “Verifikation, Konstruktion und Synthese von Programmen”, Karlsruhe: 1989

    Google Scholar 

  2. A. Bockmayr: Narrowing with built-in Theories. Proc. First International Workshop on Algebraic and Logic Programming, Gaussig (DDR ): 1988

    Google Scholar 

  3. H. J. Bürckert: Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine. Proceedings GWAI’86, IFB 124, 277–288: 1986

    Google Scholar 

  4. B. IVonhöfer, U. Furbach: Knuth-Bendix Completion versus Fold-Unfold: A Comparative Study in Program Synthesis. GWAF86, IFB 124, 289–300: 1986

    Google Scholar 

  5. U. Furbach, S. Hölldobler: Modelling the Combination of Functional and Logic Programming Languages. Journal of Symbolic Computation, 123–138: 1986

    Google Scholar 

  6. U. Rirbach, S. Hölldobler, J. Schreiber: Horn Equality Theories and Paramodulation. To appear in Journal of Automated Reasoning: 1989

    Google Scholar 

  7. J. H. Gallier, S. Raatz: Extending SLD-resolution to Equational Horn Clauses using E-unification. Journal of Logic Programming 6, 3–43: 1989

    Article  MathSciNet  MATH  Google Scholar 

  8. J. H. Gallier, W. Snyder: A Complete E-Unification Procedure. Proc. RTA, LNCS 256: 1987

    Google Scholar 

  9. S. Hölldobler: From Paramodulation to Narrowing. Proc. 5th International Conference/Symposium on Logic Programming, 327–342: 1988

    Google Scholar 

  10. S. Hölldobler: Horn Equality Theories and Complete Sets of Transformations. Proc. Fifth Generation Computer Systems, 405–412: 1988

    Google Scholar 

  11. S. Hölldobler: Foundations of Equational Logic Programming. To appear in: Lecture Notes in Artificial Intelligence 353: 1989

    Google Scholar 

  12. J. Hsiang, M. Rusinowitch: On Word Problems in Equational Theories. Proc. International Conference on Automata, Languages and Programming, LNCS 267, 54–71: 1987

    Google Scholar 

  13. G. Huet, D. Oppen: Equations and Rewrite Rules: a Survey in: Formal Languages: Perspectives and Open Problems (Book, ed.), Academic Presss, 349–405 (1980)

    Google Scholar 

  14. J. M. Hullot: Canonical Forms and Unification. Proc. 5th Conference on Automated Deduction, 318–334: 1980

    Google Scholar 

  15. Jean-Pierre Jouannaud, Claude Kirchner, Helene Kirchner: Incremental Construction of Unification Algorithms in Equational Theories. Proc. International Conference on Automata, Languages and Program-ming, LNCS 154, 361–373: 1983

    Google Scholar 

  16. J. W. Lloyd: Foundations of Logic Programming. Springer: 1984.

    Google Scholar 

  17. A. Martelli, C. Moiso, C. F. Rossi: An Algorithm for Unification in Equational Theories. Proc. Sym-posium on Logic Programming, 180–186: 1986

    Google Scholar 

  18. P. Padawitz: Computing in Horn Clause Theories, EATCS Monograph, Springer, Berlin: 1988

    Google Scholar 

  19. G. E. Peterson, M. E. Stickel: Complete Sets of Reductions for Some Equational Theories. Journal of the ACM, 233–264: 1981

    Google Scholar 

  20. G. E. Peterson: A Technique For Establishing Completeness Results in Theorem Proving With Equality, SIAM Journal of Computing, 12 (1), 82–100, 1983

    Article  MATH  Google Scholar 

  21. G. D. Plotkin: Building-In Equational Theories. In: Machine Intelligence 7 (Meitzer, Mitchie, eds.), 73–90: 1972

    Google Scholar 

  22. J. H. Siekmann: Unification Theory. Proceedings EC AI, 365–400: 1986

    Google Scholar 

  23. J. H. Siekmann: Unification Theory. To appear in Journal of Symbolic Computation: 1989

    Google Scholar 

  24. J. E. Stoy: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, M.I.T. Press: 1977

    Google Scholar 

  25. M. H. van Emden, J. W. Lloyd: A Logical Reconstruction of Prolog II. Journal of Logic Programming 1, 143–149: 1984

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Forschungsgruppe Intellektik, Institut für Informatik, TU München, Postfach 202420, D-8000, München 2, Germany (W)

    Ulrich Furbach

  2. Fachgruppe Intellektik, Fakultät für Informatik, TH Darmstadt, Alexanderstr. 10, D-6100, Darmstadt, Germany

    Steffen Hölldobler

  3. Institut für Programmiersprachen und Programmentwicklung, Fakultät für Informatik, UniBwM, Werner-Heisenberg-Weg 39, D-8014, Neubiberg, Germany

    Joachim Schreiber

Authors
  1. Ulrich Furbach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steffen Hölldobler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joachim Schreiber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computerlinguistik, Universität Bielefeld, Postfach 8640, D-4800, Bielefeld 1, Germany

    Dieter Metzing

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Furbach, U., Hölldobler, S., Schreiber, J. (1989). Linear Paramodulation modulo Equality. In: Metzing, D. (eds) GWAI-89 13th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75100-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-75100-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51743-6

  • Online ISBN: 978-3-642-75100-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation