Resolution and incomplete Knowledge Base

Assume I have an incomplete knowledge base, for example:

(rich(dave), poor(dave))  // dave is either poor or rich

(not rich(dave), not poor(dave))  // dave is not poor and rich at the same time.


My questions are: 1. If I do resolution on the above clauses, will I get the empty clause? and 2. If Yes, Does that mean my knowledge base is inconsistent?

-
All the resolution tutorials I have found only resolve one predicate at a time, and I don't know how to handle the above. –  Aida T. Nov 5 '12 at 2:27

migrated from cstheory.stackexchange.comNov 5 '12 at 16:45

This question came from our site for theoretical computer scientists and researchers in related fields.