ai-lect10

# ai-lect10 - Inference in First-Order Logic Proofs...

This preview shows pages 1–6. Sign up to view the full content.

1 Inference in First-Order Logic Proofs Unification Generalized modus ponens Forward and backward chaining Completeness Resolution Logic programming

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Inference in First-Order Logic Proofs  – extend propositional logic inference to deal with quantifiers Unification Generalized modus ponens Forward and backward chaining  – inference rules and reasoning program Completeness  – Gödel’s theorem: for FOL, any sentence entailed  by another set of sentences can be proved from that set Resolution  – inference procedure that is complete for any set of sentences Logic programming
3 Remember: propositional logic

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4 Proofs
5 Proofs The three new inference rules for FOL (compared to propositional logic) are: Universal Elimination (UE): for any sentence  α , variable x and ground term  τ , 2200 x    α    α {x/ τ } Existential Elimination (EE):

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/20/2011 for the course CS 6810 taught by Professor Hecker during the Spring '10 term at CSU East Bay.

### Page1 / 30

ai-lect10 - Inference in First-Order Logic Proofs...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online