We show that every atom a that is added to C by the algorithm is a logical consequence of KB ∪ Percepts. Suppose there is an atom h ∈ C that is not a logical consequence. Let h be the first ever such atom to be added in C. There must be some clause in KB ∪ Percepts, in the form h ← a1 ∧ · · · ∧ am such that a1, . . . , am are all in C. By assumption, KB ∪ Percepts |= ai for all 1 ≤ i ≤ m. Then it must be that KB ∪ Percepts |= h. Contradiction.是什么意思
时间: 2024-04-28 07:24:35 浏览: 157
A Fully Informed Search Algorithm (FISA)
这段文字描述了一个关于知识库(KB)和感知(Percepts)的算法,在该算法中,每个添加到集合C中的原子a都是KB和Percepts的逻辑结果。如果有一个原子h在C中,但不是它们的逻辑结果,那么假设h是第一个这样的原子被添加到C中,那么一定存在一个KB和Percepts中的子句,形式为h ← a1 ∧ · · · ∧ am,其中a1,...,am都在C中。由于假设KB和Percepts对于1 ≤ i ≤ m中的所有ai都成立,因此KB和Percepts也应该对h成立。但是这与假设相矛盾,即h不是KB和Percepts的逻辑结果。因此,原命题的结论是每个添加到C中的原子a都是KB和Percepts的逻辑结果。
阅读全文