Declarative Solutions to Partitioned-grid Problems

Sandro Etalle, Pieter H. Hartel, Willem G. Vree

    Research output: Contribution to journalArticleAcademicpeer-review

    9 Downloads (Pure)


    The problem of partitioning grid-based applications for parallel computing can be solved easily and intuitively in a logic programming language such as Prolog, using only the single assignment property of the logic variable, and not the backtracking. We show that such a logic program can be transformed in a systematic way into a circular functional program, which runs 10 times faster than the original logic program. The transformation proceeds in a number of steps. The first step is novel, and we give a correctness proof. Our reasoning also uses a novel combination of concepts from both the logical and functional paradigms.
    Original languageUndefined
    Pages (from-to)1173-1200
    Number of pages28
    JournalSoftware : practice and experience
    Issue number13
    Publication statusPublished - 1999


    • IR-55692
    • EWI-1012

    Cite this