Inference in first-order logic
Inference in first-order logic
Inference in first-order logic
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Properties of backward cha<strong>in</strong><strong>in</strong>g<br />
♦ Depth-<strong>first</strong> recursive proof search: space is l<strong>in</strong>ear <strong>in</strong> size of<br />
proof<br />
♦ Incomplete due to <strong>in</strong>f<strong>in</strong>ite loops<br />
→ fix by check<strong>in</strong>g current goal aga<strong>in</strong>st every goal on stack<br />
♦ Inefficient due to repeated subgoals (both success and<br />
failure)<br />
→ fix us<strong>in</strong>g cach<strong>in</strong>g of previous results (extra space!)<br />
♦ widely used for <strong>logic</strong> programm<strong>in</strong>g; e.g., Prolog<br />
<strong>Inference</strong> <strong>in</strong> <strong>first</strong>-<strong>order</strong> <strong>logic</strong> – 19
Change language