Question Answering Database-Style Algorithm Finder (qa db finder)

==Description==
Question Answering Database-Style Algorithm Finder (qa_db_finder) asks questions about input, what input is connected to in list form, repeating, until the desired output is attained.
 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: 
 
 What is the input variable?
 |: O
 What variable is this last variable linked to?
 |: T
 Is this the final variable? (y/n)
 |: n
 What variable is this last variable linked to?
 |: B
 Is this the final variable? (y/n)
 |: n
 What variable is this last variable linked to?
 |: O
 Is this the final variable? (y/n)
 |: y
 What is the final output variable?
 |: T
 
 A = "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.
Figure 1. Example input and output of the qa_db_finder algorithm.
In Figure 1., example output (for Cultural Translation Tool, CTT) from the algorithm is shown.  In CTT, the original is translated, but verified by back-translating back into the original language.
The qa_db_finder algorithm was written to quickly build prototypes for algorithms, which help to logically illustrate philosophies.
==Plans==
Later, list content for the qa_db_finder algorithm may be defined in input.