Prolog work needed - simple(repost)

Hello, Here is your chance to make a quick buck. I use this to compare to my own work. So, hopefully I can learn a better way of doing things and improve my skills. Requirements/Deliverables for this project: 1. Working prolog Code 2. Documentation - word document describing your code and use of the app. 3. Functionality - code must be 100% functional 4. Look and feel - simple concise and clear. DESCRIPTION Develop a Natural Language Processing system in Prolog. Your system should be able to enter into a dialogue with the user about a certain domain: computing and math courses (COMPXXX courses). The app will accept input from user in the form of sentences and provide reaction dependent on the sentence provided as input. When the user enters a declarative sentence (not a question) the system understands it and adds it to its knowledge base. When the user enters a question (i.e. a sentence ending with ' ? ', the system must answer. Hence all punctuation marks are ignored except '?'). A sample dialogue: (* represents the user, ** represent a system response). * COMP 222 is a computing course ** I comperhend * COMP 222 is a 200 level course ** I comperhend * is COMP 222 is an advanced course ** not as far as I know * all 200 courses are not advanced courses ** I comperhend * is COMP 222 is an advanced course? ** no *does COMP 222 have a prerequisite? ** not as far as I know * COMP 272 is the prerequisite of COMP 222 ** I comperhend * does COMP 222 have a prerequisite ** yes … and so on. ## Deliverables Here are some of the steps involved in the project. 1. You should explain to the user the language your system understands (i.e. words that he or she may use to form a sentence). You may even show these words in a separate window on the screen. Then the user enters a sentence. 2. When the user enters a sentence, the system should divide the input string into a list of atoms (e.g. 'COMP222 is a computing course' ------- > ['COMP222', 'is', 'a', 'computing' 'course'] ). 3. Parse the input sentence (after converting it to a list of atoms) to find if it is a correct sentence according to your language's grammar. 4. If the input sentence is valid, then if it is a declarative sentence, find a way to represent it. For example, ['COMP222', 'is', 'a', 'computing' 'course'] should be transformed to computing_course (COMP222). Also, ['COMP222', 'is', 'a', '200', 'level', 'course'] should be transformed to level_200(COMP222). Also, ['all', '400', 'courses', 'are', 'advanced', 'course'] should be transformed to advanced_course(X):- level_400(X) - so when a question is entered: 'is COMP222 is an advanced course?' and transformed as usual, the system will be able to answer 'yes' or 'no' depending on the preceding rules your system has formed. NOTES: A. Emphasis on grammer rules, parse tree must be placed! B. Have the application DRAW a parse tree representing the entered sentence when parsing it. Additional Requirements: A. Working System should be submitted B. Explain principles and theories and show where they are programmed. Thanks and good luck. 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform ASCII/GENERIC PROLOG WHERE POSSIBLE. Thanks.