Nonmonotonic reasoning reasoning in default logic
4 important questions on Nonmonotonic reasoning reasoning in default logic
Normal default theories are semi-monotonic
The addition of default rules never elimatese but extends or adds new extensions
===
Let T1 = (W, D1) and T2 = (W,D2) be default theories such that D1 is contained within D2. Then for every extension e1 of T1 there is an extensiosn e2 o T2 such that e1 is contained within e2.
Why do we need theorem proving
Resolvent of (C1, D1) and (C2,D2)
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding
Top-down default proof
A closed formula F with respect to a closed normal default theory T = (W,D) is a sequence of linear resolution proofs L0, ... Lk such that
- L0 is a linear resolution proof of F from clauses(T)
- for 0 =< i =< k, Li returns Di
- for 1 =< i =< k, Li is a linear resolution proof of pre(Di-1) from clauses(T)
- Dk = empty set
- W union U {cons(D_i) is satisfiable
The question on the page originate from the summary of the following study material:
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding