Efficient unification of quantified terms (Q3787472)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4050982
Language Label Description Also known as
default for all languages
No label defined
    English
    Efficient unification of quantified terms
    scientific article; zbMATH DE number 4050982

      Statements

      Efficient unification of quantified terms (English)
      0 references
      0 references
      0 references
      1988
      0 references
      Conventional logic-programming languages
      0 references
      symbolic computation
      0 references
      quantified terms
      0 references
      data structures
      0 references
      efficient computation
      0 references
      unification
      0 references
      Conventional logic-programming languages rely fundamentally on symbolic computation with quantifier-free terms. Much theoretical logic uses the richer vocabulary of quantified terms, however. In this paper we sketch some first steps in a program of research for developing data structures and algorithms to support efficient computation directly on quantified terms. We describe a simple concept of quantified term, and efficient unification algorithms for both structure-sharing and non-structure- sharing representations of those terms. The efficiency of the approach results from the techniques used to represent terms, which enable naive substitution to implement correct substitution for quantified terms. The non-structure-sharing unification algorithm described here has been prototyped by modification of a conventional logic-programming interpreter.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references