Project Description

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 patients 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.

You are assigned by RipeApe to develop a beta version of the system using the first order logic inference. 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.

You will use first-order logic resolution 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:

• An implication of the form p₁ p₂ p_m 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.
• A single literal: q or ~q

Note:

1. _& denotes the conjunction
2. _| denotes the disjunction It will not appear in the queries nor in the KB given as input. But you will likely need it to create your proofs.
3. _=> denotes the implication
4. _~ denotes the negation
5. No other operators besides _{&, =>}, and _~ are used in the knowledge base.
6. There will be no parentheses in the KB except as used to denote arguments of predicates.
7. Variables are denoted by a single lowercase letter.
8. All predicates (such as _HighBP) and constants (such as _Alice) are case sensitive alphabetical strings that begin with uppercase letters.
9. Each predicate takes at least one argument. Predicates will take at most 25 arguments. A given predicate name will not appear with different number of arguments.
10. There will be at most 10 queries and 100 sentences in the knowledge base.
11. See the sample input below for spacing patterns.
12. You can assume that the input format is exactly as it is described.
13. There will be no syntax errors in the given input.
14. The KB will be true (i.e., will not contain contradictions).

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.

Notes and hints:

• Please name your program xxx where xxx is the extension for the programming language you choose. (py for python, cpp for C++, and java for Java). If you are using C++11, then the name of your file should be homework11.cpp and if you are using python3 then the name of your file should be homework3.py.
• If you decide that the given statement can be inferred from the knowledge base, every variable in each sentence used in the proving process should be unified with a Constant (i.e., unify variables to constants before you trigger a step of resolution).
• All variables are assumed to be universally quantified. There is no existential quantifier in this homework. There is no need for Skolem functions or Skolem constants.
• Operator priorities apply (negation has higher priority than conjunction). There will be no parentheses in the sentences, other than around arguments of predicates.
• The knowledge base is consistent.
• If you run into a loop and there is no alternative path you can try, report FALSE. An example for this would be having two rules (1) A(x) => B(x) and (2) B(x) => A(x) and wanting to prove A(John). In this case your program should report FALSE.
• Note that the KB is not in Horn form because we allow more than one positive literal. So you indeed must use resolution and cannot use generalized Modus Ponens.

Example 1:

For this input.txt:

1

Take(Alice,NSAIDs)

2

Take(x,Warfarin) => ~Take(x,NSAIDs) Take(Alice,Warfarin)

your output.txt should be:

FALSE

Example 2:

For this input.txt:

2

Alert(Bob,NSAIDs)

Alert(Bob,VitC)

5

Take(x,Warfarin) => ~Take(x,NSAIDs)

HighBP(x) => Alert(x,NSAIDs)

Take(Bob,Antacids)

Take(Bob,VitA)

HighBP(Bob)

your output.txt should be:

TRUE

FALSE

Example 3:

For this input.txt:

3

Alert(Alice,VitE)

Alert(Bob,VitE)

Alert(John,VitE)

9

Migraine(x) & HighBP(x) => Take(x,Timolol)

Take(x,Warfarin) & Take(x,Timolol) => Alert(x,VitE)

Migraine(Alice)

Migraine(Bob)

HighBP(Bob)

OldAge(John)

HighBP(John)

Take(John,Timolol)

Take(Bob,Warfarin)

your output.txt should be:

FALSE

TRUE

FALSE