Student Work

 

Core Finding for Relational Structures Public

Downloadable Content

open in viewer

The computation of "cores" of relational structures has a variety of applications. In this project, we revise a core computation algorithm by Pichler and Savenkov, designed for the data exchange context, to work in a more general setting. Contributions to research from this project include the observation that the previous algorithm by Pichler and Savenkov may not work when disjunctions are present in theories, a revised algorithm for the new setting, and an implementation of the algorithm in Haskell. We use "signature testing" as a heuristic to improve the running time of the algorithm.

Creator
Publisher
Identifier
  • E-project-050114-124256
Advisor
Year
  • 2014
Date created
  • 2014-05-01
Resource type
Major
Rights statement
License

Relationships

In Collection:

Items

Permanent link to this page: https://digital.wpi.edu/show/8g84mn69k