Transcription of Predicate Logic - Stanford University
{{id}} {{{paragraph}}}
Example: air traffic controller
Predicate Logic - Stanford University
CHAPTER14FF FFPredicateLogicWe now turn our attention to a generalization of propositional Logic , called predi-cate, or first-order, Logic . predicates are functions ofzero or more variables thatreturn Boolean values. Thus predicates can be true sometimes and false sometimes,depending on the values of their arguments. For example, we shall find in predicatelogic atomic operands such ascsg(C, S, G). Here,csgis the Predicate name, andC,S, andGare arguments. We can think of this expression as a representationin Logic of the database relation Course-Student-Grade of Fig. It returns thevalueTRUE whenever the values ofC,S, andGare such that studentSgot gradeGin courseC, and it predicates as atomic operands, instead of propositional variables, givesus a more powerful language than expressions involving onlypropositions. In fact, Predicate Logic is expressive enough to form the basis of a number of useful program-ming languages, such as Prolog (which stands for Programming inlogic ) and thelanguage SQL that we mentioned in Section Predicate Logic is also used in rea-soning systems or expert systems, such as automatic medical diagnosis programsand theorem-proving What This Chapter Is AboutWe introduce predicates in Section As we shall see, predicates provide muchgreater power to express ideas formally t
A predicate is a generalization of a propositional variable. Recalling Section 12.10, suppose that we have three propositions: r (“It is raining”), u (“Joe takes his umbrella”), and w (“Joe gets wet”). Suppose further that we have three hypotheses,
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: