File size: 1,560 Bytes
557a17a |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 |
# Program-Finder-from-Data-
Finds recursive algorithms from the structure of data.
# Getting Started
Please read the following instructions on how to install the project on your computer for writing algorithms.
# Prerequisites
* Please download and install SWI-Prolog for your machine at `https://www.swi-prolog.org/build/`.
# 1. Install manually
Download <a href="http://github.com/luciangreen/Program-Finder-from-Data-/">this repository</a>, the <a href="https://github.com/luciangreen/listprologinterpreter">List Prolog Interpreter Repository</a>.
# 2. Or Install from List Prolog Package Manager (LPPM)
* Download the <a href="https://github.com/luciangreen/List-Prolog-Package-Manager">LPPM Repository</a>:
```
mkdir GitHub
cd GitHub/
git clone https://github.com/luciangreen/List-Prolog-Package-Manager.git
cd List-Prolog-Package-Manager
swipl
['lppm'].
lppm_install("luciangreen","Program-Finder-from-Data-").
halt
```
# Running
* In Shell:
`cd Program-Finder-from-Data-`
`swipl`
`['programfinder'].`
* Running the algorithm
To generate an algorithm:
`Input1=[["n","a"]],Inputs2=[["a",5]] ,Output=[["n", 5]] ,programfinder(Input1,Inputs2,Output,Extras,Program),writeln1(Program),international_interpret([lang,"en"],on,[[n,function],[Input1,Inputs2,[],[v,result]]],Program,Result).`
# Versioning
We will use SemVer for versioning.
# Authors
Lucian Green - Initial programmer - <a href="https://www.lucianacademy.com/">Lucian Academy</a>
# License
I licensed this project under the BSD3 License - see the LICENSE.md file for details
|