1 / 4

74.419 Artificial Intelligence Tableaux for Modal Logic

74.419 Artificial Intelligence Tableaux for Modal Logic. Reference: Graham Priest, An Introduction to Non-Classical Logic , Cambridge University Press, 2001. Tableaux. Start with negated formula. When decomposing formulas: write sub-formulas underneath for -connection.

francescag
Télécharger la présentation

74.419 Artificial Intelligence Tableaux for Modal Logic

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 74.419 Artificial IntelligenceTableaux for Modal Logic Reference:Graham Priest, An Introduction to Non-Classical Logic, Cambridge University Press, 2001

  2. Tableaux • Start with negated formula. • When decomposing formulas: • write sub-formulas underneath for -connection. • split into two branches for -connection. • Resolve formula with modal operators: • add new world number • ◊ - new formula is valid for (at least) one follow state •  - new formula is valid for all follow states • As soon as two atomic propositions P, P appear on a branch, this branch can be closed. • If all branches are closed, the theorem is proven. (Its negation always leads to a contradiction; it is not satisfiable.)

  3. j, iRj j, iRj Tableau Proof of ((AB)  AB) ((AB)  AB),0 (AB),0 (AB),0 AB,0 A,jB,j A,j A,j B,j B,j  

  4. Example of a Tableau Proof ((A  B) (B  C)) (A C),0 ((A  B) (B  C)),0 ((A C)),0 (A  B), 0 (B  C),0 ...

More Related