-
Notifications
You must be signed in to change notification settings - Fork 0
SudeepthaG/Medication-Compatibility-Predictor
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
RipeApe pharmacy is developing a self-service automated system to alert customers about potential drug interactions for both prescription and over-the-counter drugs. Many medications should not be taken together or should not be taken if a patient has certain symptoms and allergies. Evaluating all the criteria for whether a patient can take a particular medication requires the patient's medical history and expert knowledge from a health care provider. The system, however, can provide an instant guideline to keep patients informed and minimize the risks. Patient history and drug compatibility data will be encoded as first order logic clauses in the knowledge base. The program takes a query of new drug list and provide a logical conclusion whether to issue a warning. I have used first-order logic resolution(CNF) to solve this problem. Format for input.txt <N = NUMBER OF QUERIES> <QUERY 1> … <QUERY N> <K = NUMBER OF GIVEN SENTENCES IN THE KNOWLEDGE BASE> <SENTENCE 1> … <SENTENCE K> The first line contains an integer N specifying the number of queries. The following N lines contain one query per line. The line after the last query contains an integer K specifying the number of sentences in the knowledge base. The remaining K lines contain the sentences in the knowledge base, one sentence per line. Query format: Each query will be a single literal of the form Predicate(Constant_Arguments) or ~Predicate(Constant_Arguments) and will not contain any variables. Each predicate will have between 1 and 25 constant arguments. Two or more arguments will be separated by commas. KB format: Each sentence in the knowledge base is written in one of the following forms: 1) An implication of the form p1 ∧ p2 ∧ ... ∧ pm ⇒ q, where its premise is a conjunction of literals and its conclusion is a single literal. Remember that a literal is an atomic sentence or a negated atomic sentence. 2) A single literal: q or ~q Format for output.txt: For each query, determine if that query can be inferred from the knowledge base or not, one query per line: <ANSWER 1> … <ANSWER N> Each answer should be either TRUE if you can prove that the corresponding query sentence is true given the knowledge base, or FALSE if you cannot.
About
This repository contains the code for an automated system that alerts customers about potential drug interactions.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published