Compilation of Set Terms in the Logic Data Language (LDL)

  title={Compilation of Set Terms in the Logic Data Language (LDL)},
  author={O. Shmueli and S. Tsur and C. Zaniolo},
  journal={J. Log. Program.},
  • O. Shmueli, S. Tsur, C. Zaniolo
  • Published 1992
  • Computer Science
  • J. Log. Program.
  • Abstract We propose compilation methods for the efficient support of set-term matching in Horn-clause programs. Rather than using general-ourpose set-matching algorithms, we take the approach of formulating at compile time specialized computation plans that, by taking advantage of information available in the given rules, limit the number of alternatives explored. Our strategy relies on rewriting techniques to transform the problem into an “ordinary” Horn-clause compilation problem, with… CONTINUE READING

    Topics from this paper.

    Handbook of Constraint Programming
    • 1,321
    • PDF
    A Language for Programming in Logic with Finite Sets
    • 100
    Sets and constraint logic programming
    • 98
    • PDF
    The CORAL deductive system
    • 92
    • PDF
    Embedding extensional finite sets in CLP
    • 48
    • PDF
    Membership-Constraints and Complexity in Logic Programming with Sets
    • 51
    • PDF
    On the Representation and Management of Finite Sets in CLP Languages
    • 15
    • PDF


    Publications referenced by this paper.