Summary: Computational Logics For Ai

Read the summary and the most important questions on Computational Logics for AI

• 3 Propositional logic part

  This is a preview. There are 2 more flashcards available for chapter 3
  Show more cards here

• 3.2 Semanatics

  This is a preview. There are 6 more flashcards available for chapter 3.2
  Show more cards here

• Variable assignment σ_S

  
  A function that maps each variable x in V to an element of D :
  σ_S(x) in D

• 7 Nonmonotonic reasoning default logic

  This is a preview. There are 4 more flashcards available for chapter 7
  Show more cards here

• Legal reasoning - incomplete information

  Somebody is assumed innoncent unless their guilt has been proven

• Legal reasoning - rules with exceptions

  Criminal foreigners are expelled ecept when the foreigner is a political refugee

• Approchaces to nonmonotonic reasoning

  Default logic, autoepistemic logic and circumscription

• 7.1 Default logic

  This is a preview. There are 17 more flashcards available for chapter 7.1
  Show more cards here

• brid(x): flies(x)----------------------flies(x)

  If x is a bird and if it is consistent to assume that x flies, than conclude that x flies

• Difficulties of using classical logic

  • All possible preconditions should be listed
  • usage of the rull (before applied all preconditions should be true)

• Prototypical reaoning (def)

  
  Most instances of a concept have some property
  
  "typically, children have parents"
  child(x) : has-parents(x)
  __________________________
  has-parents(x)

• No-risk reasoning (def)

  
  Situations where a conclusion is drawn even if it is not hte most probably becuae another decision could lead to disaster
  
  "In absence of evidence to the contrary assume taht the accused is innocent"
  accused(x) : innocent(x)
  -------------------------------------
  innocent(x)

• A set of formulas Φ is called deductively closed

  
  
  Φ = TH(Φ) = {F | Φ |= F }
  
  
  
  Een set formules Φ is deductief gesloten als elke formule die volgt uit Φ, ook in Φ zit. Dit betekent dat Φ dezelfde formules bevat als de verzameling die wordt afgeleid uit Φ.

• 7.2 Operational semantics of default logic

  This is a preview. There are 11 more flashcards available for chapter 7.2
  Show more cards here

• A set of formulas in an extension if

  There is some closed and succesful proces Π of T such that set of formulas is IN( Π)