Question Answering Database-Style Algorithm Finder
Question Answering Database-Style Algorithm Finder is a SWI-Prolog algorithm that finds database style list-based algorithms with question answering, for example:
e.g. for cultural translation tool, the input lists of tuples: orig-trans, trans-bt where orig-bt have same meaning and input orig and output translation:
a(OT,TB,BO,O,T):-
member(A1,OT),A1=[O,T],
member(A2,TB),A2=[T,B],
member(A3,BO),A3=[B,O].
which is run as:
?- a([[a,b]],[[b,a]],[[a,a]],a,T).
T = b.
Please read the following instructions on how to install the project on your computer for writing algorithms.
- Please download and install SWI-Prolog for your machine at
https://www.swi-prolog.org/build/
.
Download this repository.
- Download the LPPM Repository:
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","qa_db_finder").
../
halt.
- In Shell:
cd qa_db_finder
swipl
['qa_db_finder.pl'].
qa_db_finder(Algorithm).
Lucian Green - Initial programmer - Lucian Academy
I licensed this project under the BSD3 License - see the LICENSE.md file for details