Download Advanced Artificial Intelligence - Computer Engineering

Advanced Artificial Intelligence
http://arf.iyte.edu.tr/~bkumova/teaching/AI
Bora İ Kumova
İzmir Institute of Technology; Department of Computer Engineering
Key Words
Logic; Cognition; Knowledge Representation; Problem Solving; Reasoning;
Learning; Communicating; Uncertainty
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 1/21
Outline
• mathematical logics: propositional logic; predicate logic
• cognitive models: architectures
• knowledge representation: semantic networks;
• reasoning: resolution; inference
• learning: deductive; inductive; abductive
• communicating: data, information, knowledge exchange
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 2/21
Advanced Artificial Intelligence
http://arf.iyte.edu.tr/~bkumova/teaching/AI
Bora İ Kumova
İzmir Institute of Technology; Department of Computer Engineering
Overview
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 3/21
History & Future
• Turing test: 1950; [Turing, Alan]
• AI: 1956 [McCarthy, John]
• failure: 1966; machine translation
• failure: 1970; Artificial Neural Networks
• “AI Winter”: 1974-80; academic progress only
• boom: 1980; PC
• collapse: 1987; AI hardware
• robotics: 1980s; embodied AI
• semantic web: 2020s; automated reasoning Internet [w 3]
• intelligent robots: 2050; robot soccer team beats human
champion [RoboCup]
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 4/21
Conclusion
• AI: facilitates smart technology
• intelligent agents: facilitate information management
• intelligent robots: facilitate managing human environment
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 5/21
Advanced Artificial Intelligence
http://arf.iyte.edu.tr/~bkumova/teaching/AI
Bora İ Kumova
İzmir Institute of Technology; Department of Computer Engineering
Mathematical Logics
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 6/21
Propositional Logic: Binary Operations & Normal Forms
• conjunction: a ∧ b
• disjunction: a ∨ b
• subjunction: a → b  a ∨ b
• bijunction: a ↔ b
• Disjunctive Normal Form (DNF): conjunction of minterms
– minterm: disjunction of negated or not negated variables
• Conjunctive Normal Form (CNF): disjunction of maxterms
– maxterm: conjunction of negated or not negated variables
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 7/21
Propositional Logic: Rule of Inference (Tautology)
• modus ponens: a ∧ a → b ⇒ b
• modus tollens: a → b ∧  b ⇒  a
• contra position: a → b ⇒  b →  a
• simplification: a ∧ b ⇒ a; a ∧ b ⇒ b
• addition: a ⇒ a ∨ b; b ⇒ a ∨ b
• chain rule: a → b ∧ b → c ⇒ a → c
• reductio ad absurdum: a → b ∧ a →  b ⇒  a
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 8/21
Predicate Logic
• universal quantifier: ∀x (for all x); eg:
– Px: x is computer engineer
– Qx: x is engineer
– ∀x(Px → Qx)
• existential quantifier: ∃x (there exists an x)
– Rx: x is female
– ∃x(Px → Rx)
İYTE; Advanced Artificial Intelligence; Spring 2011; Bora İ Kumova
Page 9/21