First-Order-Logic课件.pptxVIP

First-Order Logic精品文档Limitations of propositional logicSuppose you want to say “All humans are mortal”In propositional logic, you would need ~6.7 billion statementsSuppose you want to say “Some people can run a marathon”You would need a disjunction of ~6.7 billion statements精品文档First-order logicPropositional logic assumes the world consists of atomic factsFirst-order logic assumes the world contains objects, relations, and functions精品文档Syntax of FOLConstants: John, Sally, 2, ... Variables: x, y, a, b,...Predicates: Person(John), Siblings(John, Sally), IsOdd(2), ...Functions: MotherOf(John), Sqrt(x), ...Connectives: ?, ?, ?, ?, ?Equality: = Quantifiers: ?, ? Term: Constant or Variable or Function(Term1, ... , Termn) Atomic sentence: Predicate(Term1, ... , Termn) or Term1 = Term2Complex sentence: made from atomic sentences using connectives and quantifiers精品文档Semantics of FOLSentences are true with respect to a model and an interpretationModel contains objects (domain elements) and relations among themInterpretation specifies referents forconstant symbols → objectspredicate symbols → relationsfunction symbols → functional relations An atomic sentence Predicate(Term1, ... , Termn) is true iff the objects referred to by Term1, ... , Termn are in the relation referred to by predicate精品文档Universal quantification?x P(x)Example: “Everyone at UNC is smart”?x At(x,UNC) ? Smart(x)Why not ?x At(x,UNC) ? Smart(x)?Roughly speaking, equivalent to the conjunction of all possible instantiations of the variable:At(John, UNC) ? Smart(John) ? ...At(Richard, UNC) ? Smart(Richard) ? ...?x P(x) is true in a model m iff P(x) is true with x being each possible object in the model精品文档Existential quantification?x P(x)Example: “Someone at UNC is smart”?x At(x,UNC) ? Smart(x)Why not ?x At(x,UNC) ? Smart(x)?Roughly speaking, equivalent to the disjunction of all possible instantiations:[At(John,UNC) ? Smart(John)] ?[At(Richard,UNC) ? Smart(Richard)] ? … ?x P(x) is true in a model m iff P(