Skip to content

An implementation of Heuristic-Driven Theory Projection in Haskell

License

Notifications You must be signed in to change notification settings

heimerzieher/hdtp-haskell

Repository files navigation

Heuristic-Driven Theory Projection in Haskell

A Haskell library for Heuristic-Driven Theory Projection.

How to use

To compile everything: stack build

To work with the library in ghci: stack ghci

To run the tests: stack clean && stack test --coverage

See report.pdf for explanation of the code.

Abstract

In (Schmidt et al. 2014), the authors provide an overview of Heuristic-Driven Theory Projection (HDTP), a logic-based computational model of analogical reasoning. In this framework, an agent's knowledge of a familiar domain S is represented as a first-order theory, which can be projected into another, less familiar domain T, by constructing a more general domain G, using anti-unification of formulas (Plotkin 1970).

To our knowledge, there has been so far no implementation of HDTP in a functional programming language. In the following report, we provide a functional algorithm in Haskell for reproducing many of the aspects of HDTP laid out in (Schmidt et al. 2014).

About

An implementation of Heuristic-Driven Theory Projection in Haskell

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published