next up previous contents
Next: Humans and Robots Up: Inferring Non-knowledge Previous: Existence of parameterized sets

Non-knowledge as failure


A system based on Horn clauses, e.g. a Prolog program, may treat non-knowledged as failure. Thus if both an attempt to prove Clinton to be sitting and an attempt to prove him standing fail, the system can infer that it doesn't know whether he is sitting or standing. This is likely to be easier than establishing that it is possible that he is standing and possible that he is sitting by finding models.

John McCarthy
Mon Jul 15 13:06:22 PDT 2002