Koofers

Lecture Notes for CS 662 - Artificial Intelligence Prog at University of San Francisco (USF)

Notes Information

Material Type:Class Note
Professor:Staff
Class:CS 662 - Artificial Intelligence Prog
Subject:Computer Science
University:University of San Francisco (CA)
Term:--
Keywords:
  • Either...or
  • San Francisco
  • Conjunctive
  • Propositional
  • Expressivity
  • Contradiction
  • Conjunction
  • Propositional Logic
  • Implications
  • Satisfaction
Login / Sign Up to View Document
Preview Page 1Preview Page 2Preview Page 3Preview Page 4Preview Page 5Preview Page 6

Sample Document Text

Artificial Intelligence Programming First-Order Logic Chris Brooks Department of Computer Science University of San Francisco Representation Propositional Logic has several nice features Lets us easily express disjunction and negation "There is a pit in (1,1) or in (2,2)" "There is not a pit in (1,1)" This is hard to do in C/Java/Python - variables can only take on a single value. There's no obvious way to assign x the value "3 or 4" or "some value less than 10". Separates declarative knowledge from inference procedures Compositional The meaning of a sentence is a function of the meaning of its parts. Department of Computer Science - University of San Francisco - p.1/? Review of Propositional Logic Sentences are composed of atomic terms conjoined by operators P1,1 ?B1,2 B2,2 ?P1,2 Terms are either true or false. A model is an assignment of values to terms. The set of possible worlds that make a sentence true A model satisfies a sentence if the sentence is true given the assignm...

Related Documents

Alcoholic Beverage Notes
Definite Truth Values Notes
Forward Chaining Notes
Propositional Exam
Either...or Notes
Either...or Notes
Either...or Exam
To, at (time) Notes
Propositional Logic Notes
Conjunction Notes
Performance Measurement Notes
Performance Measurement Notes
Performance Measurement Exam
Complete Formulas Notes
Either...or Exam
Either...or Exam
155, "/var/app/current/tmp/"