SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Logic-Based Systems in AI: A Comprehensive Lecture by Prof. Carolina Ruiz

fola avatar
fola
13 diapositives · 180 Views · Feb 17, 2013

World of logic-based systems in AI with an enlightening lecture by Prof. Carolina Ruiz from Worcester Polytechnic Institute. Explore reasoning systems that enable independent agents to make decisions and act autonomously, serving as valuable tools for mathematicians, proof-checkers, and socratic reasoners. Learn about practical applications of Theorem Provers (TPs), software and hardware verification procedures, and program synthesis techniques in the realm of AI. Delve into knowledge representation, problem-solving strategies, and proof by refutation using resolution methods. Gain insights into solving complex logic-based problems and explore the practical implications of logical reasoning systems.

Logic-Based Systems in AI: A Comprehensive Lecture by Prof. Carolina Ruiz - slide 1
01 / 13Logic-Based Systems in AI: A Comprehensive Lecture by Prof. Carolina Ruiz
1 / 17

Télécharger la présentation

Logic-Based Systems in AI: A Comprehensive Lecture by Prof. Carolina Ruiz
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Logic-Based Systems AI Lecture Prof. Carolina Ruiz Worcester Polytechnic Institute

  2. AS REASONING SYSTEMS to implement independent agents that make decisions and act on their own. AS ASSISTANTS tool for mathemathicians Proof-Checkers: mathematician provides a sketch of the proof and TP checks it and fills in the details. Socratic Reasoners: (e.g. ONTIC). Mathematician and TP construct proof together. Using Theorem Provers AI Lecture - Prof. Carolina Ruiz

  3. Practical uses of Theorem Provers (TPs) AI Lecture - Prof. Carolina Ruiz

  4. SOFTWARE procedure swap(x,y) var t; {Pre: x = C1, y = C2} t := x; x:= y; y:= t {Post: x = C2, y = C1} HARDWARE CS/ECE: Verification of Systems x y w z w = ( x OR y) and ~z AI Lecture - Prof. Carolina Ruiz

  5. SOFTWARE Boyer & Moore: verified the RSA public key encryption algorithm verified the Boyer & Moore string matching algorithm HARDWARE Aura: Verifies design of a 10-bit adder MRS: performs diagnosis of computer systems CS/ECE: Verification of Systems AI Lecture - Prof. Carolina Ruiz

  6. SOFTWARE procedure swap(x,y) {Pre: x = C1, y = C2} ? {Post: x = C2, y = C1} Prove that there exists a program satisfying the specification. If the proof is constructed, a program can be extracted. HARDWARE CS/ECE: Synthesis of Systems x ? y w z w = ( x OR y) and ~z AURA: used to design circuits more compact than before AI Lecture - Prof. Carolina Ruiz

  7. Inside a Logic-based System Knowledge Representation First order logic Problem Solving Strategy Refutation using resolution AI Lecture - Prof. Carolina Ruiz

  8. Knowledge representation 1st order logic • Everybody who can read is literate • x, r(x) -> l(x) • Dolphins are not literate • x, d(x) -> !l(x) • Some dolphins are intelligent • Э x, [d(x) & i(x) ] • Some who are intelligent cannot read • Э x, [i(x) & !r(x)] A A AI Lecture - Prof. Carolina Ruiz

  9. Problem Solving Problem Statement • A1: Everybody who can read is literate • x, r(x) -> l(x) • A2: Dolphins are not literate • x, d(x) -> !l(x) • A3: Some dolphins are intelligent • Э x, [d(x) & i(x) ] • Conclusion: Some who are intelligent cannot read • Э x, [i(x) & !r(x)] A A AI Lecture - Prof. Carolina Ruiz

  10. Problem Solving Proof by Refutation • A1: Everybody who can read is literate • x, r(x) -> l(x) • A2: Dolphins are not literate • x, d(x) -> !l(x) • A3: Some dolphins are intelligent • Э x, [d(x) & i(x) ] • ! Conclusion: it is not the case that some who are intelligent cannot read • !Э x, [i(x) & !r(x)] = x, [!i(x) || !!r(x)] = x, [!i(x) || r(x)] A A A A AI Lecture - Prof. Carolina Ruiz

  11. A1:x, !r(x) || l(x) • A2:x, !d(x) || !l(x) • A3: Э x, [d(x) & i(x)] • !C: x, [!i(x) || r(x)] A A A Problem Solving Proof by Refutation using Resolutiontranslating formulas into clausal form • A1:x, r(x) -> l(x) • A2:x, d(x) -> !l(x) • A3: Э x, [d(x) & i(x)] • !C: x, [!i(x) || r(x)] A A A AI Lecture - Prof. Carolina Ruiz

  12. Problem Solving Proof by Refutation using Resolutiontranslating formulas into clausal form – done! • A1:!r(x) || l(x) • A2:!d(x) || !l(x) • A3.1: d(a) • A3.2: i(a) • !C: !i(x) || r(x) • A1:x, !r(x) || l(x) • A2:x, !d(x) || !l(x) • A3: Э x, [d(x) & i(x) ] • !C: x, [!i(x) || r(x)] A A A AI Lecture - Prof. Carolina Ruiz

  13. Hence C is a logical consequence of A1,A2,A3 Contradiction!!!  • A1:!r(x) || l(x) • A2:!d(x) || !l(x) • A3.1: d(a) • A3.2: i(a) • !C: !i(x) || r(x) Problem Solving Resolution • A1:!r(x) || l(x) • A2:!d(x) || !l(x) • A4: !r(x) || !d(x) • A3.1: d(a) • A5: !r(a) • !C: !i(x) || r(x) • A6: !i(a) • A3.2: i(a) • A7: AI Lecture - Prof. Carolina Ruiz