1 / 5

Resolution-based theorem proving (first-order logic)

Resolution-based theorem proving (first-order logic). Otter / Prover9. Grundlagen. Horn-Klausel : Höchstens ein positives Literal Horn-Formel : konjunktive Normalform Konjunktion von Disjunktionen Disjunktionsterme sind Hornklauseln. Resolution.

pia
Download Presentation

Resolution-based theorem proving (first-order 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. Resolution-based theorem proving (first-order logic) Otter / Prover9

  2. Grundlagen Horn-Klausel : • Höchstens einpositives Literal Horn-Formel : • konjunktive Normalform • Konjunktion von Disjunktionen • Disjunktionsterme sind Hornklauseln

  3. Resolution • Test auf logische Gültigkeit/Konsistenz • Hornklauseln H₁, H₂, Literal L • H₁ enthält L, H₂ enthält !L • Resolvente von H₁, H₂ existiert • Resolvente ist notw. Bd. für H₁, H₂ • Resolution von [] folgt unerfüllbarkeit

  4. Exemplarisches Bsp. • Bsp.: „John isthesonofPeter.“ • issonof(john,peter) • issonof(x,y) -> male(x) • male(x) -> !female(x) • Resolution von „John is male.“ • male(john)

  5. Resolutions Baum

More Related