🚀 go-pugleaf

Hello, I am looking for some information concerning the  "Validation of Prolog
data bases". 

More precisely, I'd like to know if some work have been done for
checking inconsistencies in prolog data-bases, as it has been done in the
expert system field. 

Namely, consistency checking in production-system based expert-systems is 
tackled as follow :

"Find the initial fact bases that may lead to some contradiction when applying 
a given (usely monotonic) rule-base to them."

Contradictions are usely expressed as "integrity constraints" like 
in data-bases, that is as conjunctions of contradictory predicates
(eg. Large(X) AND Small(X))

Mapping this approach into a  Prolog framework, we get something like :

Let C1 be a set of clauses. (The "rules")

Let C2 be a set of goals which are considered as contradictions, whenever they
can be achieved. (The "integrity constraints")

Find the ground litterals that, when added to C1, entail the proof of at least
one C2 element. (The faulty "initial fact bases") 


Has anything of this sort been done ? If so,  where could I find some 
references ?

Thanks in advance for your help.


Marc