Skip to main content
SpringerLink
Log in

Constrained equational deduction

  • Chapter 7 Extension Of Unification And Narrowing Techniques
  • Conference paper
  • First Online:
Conditional and Typed Rewriting Systems (CTRS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 516))

Included in the following conference series:

Abstract

In the areas of automated deduction, algebraic specification and declarative programming, symbolic computation is always required to cooperate with computation in concrete mathematical systems. Therefore, to design a deduction mechanism within equational programming logic camp, symbolic equational deduction should be extended to exploit the semantic information behind abstract symbols. In this paper, we propose constrained equational deduction as a framework for such an extension within a general constraint equational logic programming setting. Constrained equational deduction takes advantage of the hierarchical constraint information within the equations and establishs a smooth link between symbolic equational deduction and various constraint solving mechanisms. We present a constructive approach to combine a constraint system in the domain of discourse with the symbolic equational constraints in the term space to establish the constraint equational logic programming paradigm. Constrained equational deduction models are then presented to be the computational model of the paradigm.

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. A. Boudet, J-P. Jouannaud, and M. Schmidt-Schauss. Unification in boolean rings and abelian groups. Proceedings of LICS'88, 1988.

    Google Scholar 

  2. H-J. Burckert A Resolution Principle for Clauses with Constraints Proceedings of CADE 90, July.1990.

    Google Scholar 

  3. R. Burstall and J. Goguen The Semantics of Clear, A Specification Language LNCS 86, 1980

    Google Scholar 

  4. N. Dershowitz and D.A. Plaisted, Equational Programming in Machine Intelligence, 1986.

    Google Scholar 

  5. J.Darlington, Y.Guo and H.Lock Developing Phoenix Design Space: A Uniform Framework of Declarative Languages Phoenix Project Report, Imperial College May, 1990.

    Google Scholar 

  6. N. Dershowitz and J.P. Jouannaud. Rewrite systems in Van Leuven, editor, Handbook of Theoretical Computer Science North Holland, 1990

    Google Scholar 

  7. J.H.Gallier and W.Snyder A General Complete E-Unification Procedure Proceedinds of RTA'87 LNCS 256 1987.

    Google Scholar 

  8. W.Snyder and J.H.Gallier Higher Order Unification Revisited: Complete Set of Transformations Journal of Symbolic Computation 8, 1989.

    Google Scholar 

  9. J. Goguen and R.Burstall INSTITUTIONS: Abstract Model Theory for Specification and Programming TR CSLI-85-30 SRI, 1985.

    Google Scholar 

  10. J. Goguen and J. Meseguer Equality, Types, Modules, and (why not?) Generics for Logic Programming Journal of Logic Programminglp, Vol 2, 1984.

    Google Scholar 

  11. J. Goguen and J. Meseguer Universal Realization, Persistent interconnection and Implementation of Abstract Modules Proceedings of 9th ICALP, LNCS 140, 1982

    Google Scholar 

  12. G.Huet, D. C. Oppen Equations and Rewrite Rules In: Formal Languages: Perspectives and Open Problems, Academic Press, 1980

    Google Scholar 

  13. S. Hölldobler Foundational of Equational Logic Programming LNCS 353 1989.

    Google Scholar 

  14. J.Jaffer, J. Lassez and M. Maher Constraint Logic Programming Proc. of 14th ACM Symp. POPL, 1987

    Google Scholar 

  15. J.P.Jouannaud, C. Kirchner and H. Kirchner Incremental Construction of Unification Algorithms in Equational Theories ICALP'83 LNCS 154 1983.

    Google Scholar 

  16. S. Kaplan Conditional Rewrite Rules Theoretical Computer Science Vol.33, pp175–193, 1984.

    Google Scholar 

  17. C. Kirchner and H. Kirchner Constrained Equational Reasoning Proceedings of The ACM International Symposium on Symbolic and Algebraic Computation. July 1989.

    Google Scholar 

  18. J. L. Lassez, M. Maher, and K. Marriot. Unification revisited. in J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan-Kaufman, 1988

    Google Scholar 

  19. J.L.Lassez. Querying Constraints IBM technical report, Jan 1990

    Google Scholar 

  20. J.W. Lawvere Functorial Semantics of Algebraic Theories Proceedings, National Academy of Science USA, 1963.

    Google Scholar 

  21. J. Meseguer General Logics SRI-I-CSL-89-5 Mar,1989.

    Google Scholar 

  22. J. Goguen and J. Meseguer Models and Equality for Logic Programming Proceedings TAPSOFT 87, LNCS 250, 1987.

    Google Scholar 

  23. J. Meseguer Rewriting as a Unified Model of Concurrency SRI-CSL-90-02R Feb,1990.

    Google Scholar 

  24. A. Martelli and U. Montanari An Efficient Unification Algorithm ACM Transactions on Programming Languages and Systems 4. 1982.

    Google Scholar 

  25. G.D. Plotkin Building-In Equational Theories In Machine Intelligence 7 73–90, 1972.

    Google Scholar 

  26. J.W. Roach, R. Sundararajan and L.T. Waston Replacing Unification by Constraint Satisfaction to Improve Logic Program Expressiveness Journal of Automated Reasoning 6, 51–75, 1990.

    Google Scholar 

  27. G.Smolka Logic Programming over Polymorphically Order-Sorted Types Ph.D Thesis Universitat Kaiserslautern 1989.

    Google Scholar 

  28. M.E. Stickel Automated Deduction by Theory Resolution Journal of Automated Reasoning 1, 333–356 1985.

    Google Scholar 

  29. M. Schmidt-Schauss Unification in a Combination of Arbitrary Disjoint Equational Theories Proceedings of CADE 1988.

    Google Scholar 

  30. W.Snyder and C.Lynch An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Equality in Logiv Programming Proceedings of CTRS90, June 1990

    Google Scholar 

  31. J.A.Robinson and L.Wos Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving In Word Problem P609–639, 1973.

    Google Scholar 

  32. H. Zhang and J.L. Remy Contextual Rewriting Proceedings of RTA 85' LNCS 202 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College, 180 Queen's Gate, SW7 2BZ, London, U.K.

    John Darlington & Yike Guo

Authors
  1. John Darlington
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yike Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Kaplan M. Okada

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Darlington, J., Guo, Y. (1991). Constrained equational deduction. In: Kaplan, S., Okada, M. (eds) Conditional and Typed Rewriting Systems. CTRS 1990. Lecture Notes in Computer Science, vol 516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54317-1_111

Download citation

  • DOI: https://doi.org/10.1007/3-540-54317-1_111

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation