Catalogue of Artificial Intelligence Techniques

   

Jump to: Top | Entry | References | Comments

View Maths as: Images | MathML

Contradiction Backtracing

Keywords: learning, semantic evaluation

Categories: Learning


Author(s): Maarten van Someren

A method to discover and correct faulty hypotheses in a theory. If a proposition that is derived from a set of hypotheses turns out to be false in terms of a model, the derivation can be used to identify the faulty hypotheses. Contradiction backtracing uses the trace of a Resolution proof, in which the false proposition was the goal. The proof is traced backwards from the empty clause. Each clause is semantically evaluated by the user or in a standard model. If it is false, the negated parent clause is considered next, and otherwise the positive parent. The substitutions that allowed the resolution steps are accumulated and applied to each following clause. The procedure will finally lead to a hypothesis which is false.


References:


Comments:

Add Comment

No comments.