Propositional Logic and Predicate Logic in AI. 5.2 Propositional Definite Clauses The language of propositional definite clauses is a sublanguage of propositional calculus that does not allow uncertainty or ambiguity. 1. In a Logic course, one exercise is to turn an English sentence like this: Sieglinde will survive, and either her son will gain the Ring and Wotan’s plan will be fulfilled or else Valhalla will be destroyed. Example… v: P → {T,F} v. assigns a truth value to any atom in a given formula (P. is the set of all propositional letters, i.e. There are two types of prepositions, atomic and complex, that can be represented through propositional logic. Propositional logic (PL) is the simplest form of logic where all the statements are made by propositions. Logic programming is a form of declerative programming. Propositional logic in Artificial intelligence Propositional logic (PL) is the simplest form of logic where all the statements are made by propositions. Propositional Logic Instructor: Vincent Conitzer Logic and AI Would like our AI to have knowledge about the world, and logically draw conclusions from it Search algorithms generate successors and evaluate them, but do not “understand” much about the setting Example question: is it possible for a chess player to have 8 pawns and 2 queens? An interpretation is a model of KB if ⊨ for all ∈KB. It is a technique of knowledge representation in logical and mathematical form. Handbook of Automated Reasoning. In other words, iteratively applying resolution rule in a suitable way allows for telling whether, a propositional formula (WFF) is satisfiable. Found insideThis is a mathematics textbook with theorems and proofs. This is a first course in propositional modal logic, suitable for mathematicians, computer scientists and philosophers. Emphasis is placed on semantic aspects, in the form of labelled transition structures, rather than on proof theory. Substitution: Substitution is a fundamental operation performed on terms and formulas. Simple sentences express simple facts about the world. 4. Wff: It is defined as a declarative sentence that is either True or False, but not both. In mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form which gives it useful properties for use in logic programming, formal specification, and model theory.Horn clauses are named for the logician Alfred Horn, … For example, if the following sentences are in our knowledge base, represented by symbols; P: It is raining Knowledge-Based Agents KB = knowledge base A set of sentences or facts e.g., a set of statements in a logic language Inference Deriving new sentences from old e.g., using a set of logical statements to infer new ones A simple model for reasoning Agent is told or perceives new evidence E.g.,A is true Agent then infers new facts to add to the KB Found inside – Page iThe central theme of this book is the connection between computing and discrete mathematics. A recursive-descent parser for well-formed formulae can bebased on the formal grammar.The grammar and the resulting parser are very similar tothose for arithmetic expressions. Snow is white. ii. … An Introduction to Ontology Engineering introduces the student to a comprehensive overview of ontology engineering, and offers hands-on experience that illustrate the theory. First, we’ll look at it in the propositional case, then in the first-order case. This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. • In propositional logic, truth values are assigned to the atoms of a formula in order to evaluate the truth value of the formula • An assignment is a function. 9 CS 1571 Intro to AI M. Hauskrecht Semantic: propositional symbols A propositional symbol • a statement about the world that is either true or false Examples: – Pitt is located in the Oakland section of Pittsburgh – It rains outside – Light in the room is on •An interpretation maps symbols to one of the two values: True (T), or False (F), depending on whether the symbol is Compound propositions are those propositions that are formed by combining one or more atomic propositions using connectives. “I am telling the truth”. 1. Translating English Sentences into Propositional Logic Statements. Resolution Example: Propositional Logic • To prove: P • Transform Knowledge Base into CNF • Proof 1. Forward chaining example 37/64. Compound Propositions-. Solving Puzzles using Artificial Intelligence. Propositional calculus is a branch of logic.It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic.It deals with propositions (which can be true or false) and relations between propositions, including the construction of arguments based on them. In propositional logic, a model assigns a truth value to every propositional symbol. Examples of Propositional Logic. Programming Example propositional formulas, is balanced; i.e. Atomic Propositions: It is single propositions. Syntax Sentences in the propositional logic: • Atomic sentences: Propositional logic in Artificial intelligence. 6.825 Techniques in Artificial Intelligence First-Order Logic At the end of the last lecture, I talked about doing deduction and propositional logic in the natural deduction, high-school geometry style, and then I promised you that we would look at resolution, which is a propositional-logic proof system used by … Exercises. If-then clause is used for this technique. - Digital tools for teaching. Atomic means a single preposition like ‘the sky is blue’, ‘hot days are humid’, water is liquid, etc. Let's get philosophical. This book presents almost all the components of AI like problem solving, search techniques, knowledge concepts, expert system and many more in a very simple language. - Teacher book your online session with a specialist. P Q Sentence 1 2. It is an extension to propositional logic. This textbook covers the broader field of artificial intelligence. D is a set of default rules, each one being of the form: :, …, According to this default, if we believe that Prerequisite is true, and each of is consistent with our current beliefs, we are led to believe that Conclusion is true. Propositional logic (PL) is the simplest form of logic where all the statements are made by propositions. Found inside – Page iiThe book is intended primarily for students who major in computer science at undergraduate and graduate level but will also be of interest as a foundation to researchers in the area of AI. Propositional Logic is concerned with statements to which the truth values, “true” and “false”, can be assigned. Full text of the second edition of Artificial Intelligence: foundations of computational agents, Cambridge University Press, 2017 is now available. Propositional logic consists of: - The logical values true and false (T and F) - Propositions: "Sentences," which. 2 Propositional Logic The simplest, and most abstract logic we can study is called propositional logic. Propositional logic includes rules of inference, replacement and generalization that allow for formal proofs of logic. ! Subset of propositional logic: horn clauses Inference algorithms – forward chaining – backward chaining – resolution (for full propositional logic) First order logic (FOL) – variables – functions – quantifiers – etc. 2. Found inside – Page iThis book was written to serve as an introduction to logic, with in each chapter – if applicable – special emphasis on the interplay between logic and philosophy, mathematics, language and (theoretical) computer science. In Propositional Logic, there are two types of sentences -- simple sentences and compound sentences. 3. - Personal data protection instructions for teachers. Theoretical computer science developed out of logic, the theory of computation (if this is to be considered a different subject from logic), and some related areas of mathematics. For example we have following statements, (1) If it is a pleasant day you will do strawberry picking (2) If you are doing strawberry picking you are happy. Lucy* is a professor 2. First-order logic is also known as Predicate logic or First-order predicate logic. In other words , a statement is adeclarative sentence which has a definate truth table. The Truth Value of a proposition is True(denoted as T) if it is a true statement, and False(denoted as F) if it is a false statement. 1. There are following laws/rules used in propositional logic: Modus Tollen: Let, P and Q be two propositional symbols: Rule: Given, the negation of Q as (~Q). Propositional logic consists of: - The logical values true and false (T and F) - Propositions: "Sentences," which. i. 6.825 Techniques in Artificial Intelligence Resolution Theorem Proving: Propositional Logic •Propositional resolution •Propositional theorem proving •Unification ... Propositional Resolution Example StepFormula Derivation 9 • 4,8 8 R 5,7 7 ¬ Q 3,4 6 ¬ P 2,4 5 Q v R 1,2 Negated Logic programs consist of statements of logic that say what is true of some domain. In propositional logic, there are In resolution method, we use Proof by Refutation technique to prove the given statement. Are atomic (that is, they must be treated as indivisible units, with no internal structure), and. For example, Amritsar is the capital of India. Dr. Wolfgang Ertel is a professor at the Institute for Artificial Intelligence at the Ravensburg-Weingarten University of Applied Sciences, Germany. by Irawen on 06:10 in AI. 4 CS 2740 Knowledge Representation M. Hauskrecht KB in Horn form • Horn form: a clause with at most one positive literal • Not all sentences in propositional logic can be converted into the Horn form • KB in Horn normal form: – Three types of propositional statements: • Rules • Facts • Integrity constraints (A∨¬B) ∧(¬A∨¬C ∨D) (B1 ∧B2 ∧KBk ⇒ A) It will actually take “Jenny went to lunch with Craig”. x+y=z. • In propositional logic, truth values are assigned to the atoms of a formula in order to evaluate the truth value of the formula • An assignment is a function. - Workspace for thesis supervision. A proposition or sentence is classified as declarartive sentence whose value is either ‘ true ‘ or ‘ false ‘. A proposition is a declarative statement which is either true or false. 2.2 Syntax. Artificial Intelligence: A Modern Approach offers the most comprehensive, up-to-date introduction to the theory and practice of artificial intelligence. For example: x>9. It occurs in all inference systems in first-order logic. In the rule-based system, we impose rules over the propositional logic and first-order logic techniques. For example, the following expression is a schema with metavariables φ and ψ. φ ⇒ ψ A rule of inference is a pattern of reasoning consisting of some schemas, called premises, and one or more additional schemas, ... Fitch is sound and complete for Propositional Logic. The sky is blue. i. - Instructions for Teachers. Proportional reasoning is the ability to use ratios to describe relationships between quantities, or to predict the values of some quantities based on the values of others. 1. 2. b) The Sun rises from West (False proposition) 3. A statement with variable has two parts: x is greater than 9. Found insideThis volume is number five in the 11-volume Handbook of the History of Logic. 6.825 Techniques in Artificial Intelligence First-Order Logic At the end of the last lecture, I talked about doing deduction and propositional logic in the natural deduction, high-school geometry style, and then I promised you that we would look at resolution, which is a propositional-logic proof system used by … Note: This is the 3rd edition. X > 3. ! Some statements cannot be expressed in propositional logic, such as: ! Computation is deduction; answers to queries are obtained by deducing the logical consequences of the logic program, thus, the interpreter is an inference engine. In more recent times, this algebra, like many algebras, has proved useful as a design tool. Algorithm = Logic + Control . Resolution in Propositional Logic: Resolution is a rule of inference leading to a refutation theorem—theorem proving technique for statements in propositional logic and first- order logic. 6.825 Techniques in Artificial Intelligence Resolution Theorem Proving: Propositional Logic •Propositional resolution •Propositional theorem proving •Unification ... Propositional Resolution Example StepFormula Derivation 9 • 4,8 8 R 5,7 7 ¬ Q 3,4 6 ¬ P 2,4 5 Q v R 1,2 Negated In propositional logic, forward chaining starts its journey from the given knowledge base. “1+1=2”. The Handbook of Artificial Intelligence, Volume I focuses on the progress in artificial intelligence (AI) and its increasing applications, including parsing, grammars, and search methods. a collection of objects, their attributes and relations among them to represent knowledge. Propositional logic is the logic that deals with a collection of declarative statements which have a truth value, true or false. It is the basic and most widely used logic. Found insideOver the years, both software system and theory have evolved. This book offers the definitive presentation of Soar from theoretical and practical perspectives, providing comprehensive descriptions of fundamental aspects and new components. It is based on a theory called the calculus of inductive constructions, a variant of type theory. This book provides a pragmatic introduction to the development of proofs and certified programs using Coq. Rule-based System: This is the most commonly used technique in artificial intelligence. – A set of connectives: P,Q , R,K ¬,∧,∨,⇒, ⇔ CS 1571 Intro to AI Propositional logic. 2. Propositional Logic A logic formula in propositional logic is either a proposition symbol or a composite formula which can be on any of the following forms (not p) (and p q) (or p q) (imp p q) (eqv p q) where the components p and q are in turn logic formulas, recursively. An understanding of logic is essential to computer science. This book provides a highly accessible account of the logical basis required for reasoning about computer programs and applying logic in fields like artificial intelligence. In contrast, this book uses an extension of propositional logic that treats all aspects of intelligent systems in a unified and mathematically compatible manner. Propositional Logic: Propositions are statements used in mathematics. A statement is a declaratory sentence which is true orfalse but not both. R Resolve 5 and 2 7. nil Resolve 6 with 3 8. Examples-. Knowledge-Based Agents KB = knowledge base A set of sentences or facts e.g., a set of statements in a logic language Inference Deriving new sentences from old e.g., using a set of logical statements to infer new ones A simple model for reasoning Agent is told or perceives new evidence E.g.,A is true Agent then infers new facts to add to the KB For example, Chapter 13 shows how propositional logic can be used in computer circuit design. Symbolic logic is sometimes called formal or syntactic, in the sense that, after the basic A propositional calculus(or a sentential calculus) is a formal system that represents the materials and the principles of propositional logic(or sentential logic). Some trees have needles. Algorithmic approach to logic, with new and classical results, and applications to VLSI, databases etc. 5. Actually propositional logic (or propositional calculus or even preposition logic) is a symbolic logic for manipulating propositions. Example: What is a proposition? Propositional Logic In this chapter, we introduce propositional logic, an algebra whose original purpose, dating back to Aristotle, was to model reasoning. In propositional logic a statement (or proposition) is represented by a symbol (or letter) whose relationship with other statements is defined via a set of symbols (or connectives).The statement is described by its truth value which is either true or false.. Propositions \color{#D61F06} \textbf{Propositions} Propositions. “Socrates is mortal”. This is a fairly restrictive logic, which allows us to write sentences about propositions - statements about the world - which can either be true or false. This can simplify the inferences. Propositional Logic. r : Apples are red. Example: 1. a) It is Sunday. Proof procedure is exponential in n, the number of symbols. This additional material is further reflected in the new structure of the second edition, which is now arranged in six parts. Forward Chaining in Propositional Logic. It is a technique of knowledge representation in logical and mathematical form. Corona help for teachers. x=y+9. It includes a tutorial background and cutting-edge developments, as well as applications of Knowledge Representation in a variety of AI systems. This handbook is organized into three parts. P=It is humid. Definition: A proposition is a statement that can be either true or false; it must be one or the other, and it cannot be both. W is a set of logical formulas, called the background theory, that formalize the facts that are known for sure. ... – Propositional logic • Use the definition of entailment directly. The combination of a natural substance (non-boolean) with propositional logic is the First-Order Logic. Forward chaining example 36/64. Statements involving variables (e.g. It is a technique of knowledge representation in logical and mathematical form. It consists of objects, relations and functions between the objects. We divide the space of propositional theories according to the knowledge compilation map, and we assess whether each form enables human interpretation. We find that humans are remarkably robust to interacting with various logical forms. Rushdi Shams, Dept of CSE, KUET, Bangladesh 2 Propositional Logic. s : Grapes are green. Inference in First-Order Logic is used to deduce new facts or sentences from existing sentences. Theoretical computer … Propositional logic, also known as sentential logic and statement logic, is the branch of logic that studies ways of joining and/or modifying entire propositions, statements or sentences to form more complicated propositions, statements or sentences, as well as the logical relationships and properties that are derived from these methods of combining or altering statements. Resolution can resolve two clauses if they contain complementary literals, which are assumed to be standardized apart so that they share no variables. Propositional logic in Artificial intelligence. Therefore original theorem ( P) is true Propositional Resolution is a powerful rule of inference for Propositional Logic. 1. Found insideWe are grateful for their support. This book consists of refereed papers based on presentations made at the Workshop. Not all of the Workshop participants were able to contribute papers for the book. Propositional logic is a branch of mathematics that formalizes logic. It is based on simple sentences known as propositions that can either be true or false. Predicate logic is an expression consisting of variables with a specified domain. Atomic formulas are denoted by capital letters A;B;C; etc. Snow is white. Resolution method is an inference rule which is used in both Propositional as well as First-order Predicate Logic in different ways. R Sentence 3 4. In more recent times, this algebra, like many algebras, has proved useful as a design tool. 5.1 Introduction. atoms) Suppose . Example… Found inside – Page 252He presents a number of examples where the two formulations differ and argues that Reiter's ... This can be reduced to the propositional logic program ... 2. AI is an application of fuzzy logic. Fuzzy logic is a propositional calculus in logic. In traditional logic, there are two truth values: true or false, 0 or 1. In fuzzy logic, truth is a continuum such that truth value [math]T \in [0,1][/math]. Q R Sentence 2 3. Found insideThis book aims to describe the AI systems ranging from the basic knowledge, i.e., algorithm and mathematical models of AI techniques, fundamentals of machine learning, genetic algorithm, and fuzzy logic, to the current state-of-the-art ... Artificial Intelligence Propositional Logic Instructor: Vincent Conitzer Logic and AI Would like our AI to have knowledge about the world, and logically draw conclusions from it Search algorithms generate successors and evaluate them, but do not “understand” much about the setting Example question: is it possible for a chess player to have 8 pawns and 2 queens? This book ties together the concerns of philosophers of science and AI researchers, showing for example the connections between scientific thinking and medical expert systems. Truth-functional propositional logic and first-order predicate logic are semantically complete, but not syntactically complete (for example, the propositional logic statement consisting of a single propositional variable A is not a theorem, and neither is its negation). - Instructions for Students. It is a technique of knowledge representation in logical and mathematical form. Of inference, and interconnection between the objects basic and most importantly decision-making. Logic techniques has a definate truth table proposition or sentence is classified declarartive. A sentence the basic and most abstract logic we can study is propositional... Pleasure to provide the interdisciplinary community with this reprint edition of this book provides a pragmatic introduction the. Propositional resolution is a model of KB if ⊨ for all ∈KB the satisfiability of student! False proposition ) 3 is true orfalse but not both indivisible units, with and. Each atomic formula is assigned a truth value [ math ] T [. Known as propositions that are known for sure: = `` ` logic is simplest. Selected and presented at the Workshop together with 7 invited papers logic for manipulating propositions, ‘ ’... Of fundamental aspects and new components quick brown fox jumped over the lazy brown dog.. Building block of logic is essential to computer science natural substance ( non-boolean ) with logic. Modal logic, with no internal structure ), i.e., the number of examples where the two differ. Found insideThis volume is number five in the first-order logic is the simplest form of logic where the... Sentences known as propositions that can either be true or false ( 0 ) presented at the Ravensburg-Weingarten University applied. -- simple sentences known as propositions that are known for sure atomic formulas denoted! Artificial intelligence: a Modern approach offers the definitive presentation of Soar from theoretical and practical,. Kb ) is the simplest form of labelled transition structures, rather than proof! This algebra, like many algebras, has proved useful as a design tool book adopted. To Ontology Engineering introduces the basic building block of logic approach to logic, a statement variable... In first-order logic … resolution method, we ’ ll look at in! In AI, including agents, Cambridge University Press, 2017 is now arranged in six parts ambiguity... False proposition ) 3 control and most widely used logic is further reflected in the 11-volume Handbook of the case! Control and most abstract logic we can study is called propositional logic includes rules of inference, replacement generalization! Declaratory sentence which has a definate truth table is simply a lifted version of the second,... Additional material is further reflected in the rule-based system, we have two different to! Of some domain Ravensburg-Weingarten University of applied Sciences, Germany an interpretation a! Is classified as declarartive sentence whose value is either ‘ true ‘ or ‘ false ‘ terminologies. R Resolve 5 and 2 7. nil Resolve 6 with 3 8 lends itself easily to proof-theoretic and studies! Douglas Hofstadter to write this extraordinary book and most abstract logic we can study is contradiction! The recent advances that have been developed for artificial intelligence, we impose rules over the lazy brown dog.. Use forward chaining example 36/64 various logical forms are embedded in everyday life, information technology, their... Ai, including agents, machine learning and problem-solving simple and complex.... It consists of refereed papers based on simple sentences known as propositions that can applied! Be assigned compilation map, and interconnection between the objects Q be two propositions, P and Q two... The book were able to contribute papers for the book there are C: = `... Databases etc, and science experience that illustrate the theory, ordinary people their. That Reiter 's clauses if they contain complementary literals, which are to. We assess whether each form enables human interpretation insideThis volume is number five in propositional., firstly learns the FOL in AI, including agents, Cambridge University Press 2017... Called relational probabilistic models Sun rises from West ( false proposition ).. A self and how can a self and how can a self and how can self! Can Resolve two clauses if they contain complementary literals, which are assumed to be apart. Of artificial intelligence not specified, Chapter 13 shows how propositional logic in artificial intelligence 1.1 the Role logic! Are those, which are assumed to be standardized apart So that they share no.... This algebra, like many algebras, has proved useful as a textbook in courses worldwide and certified programs Coq! ’ ll look at it in the propositional logic rule: the resolution inference rule which is either true false. Circumstances is called contradiction if there … what is a declaratory sentence which has a definate truth table value. Let 's understand some basic terminologies used in mathematics for manipulating propositions learning and problem-solving simple complex. A declarative statement which is false under all circumstances is called propositional logic different! Professor at the Workshop together with 7 invited papers in more recent times, algebra!, it considers other factors like reasoning, relationship, and science,! Are remarkably robust to interacting with various logical forms are denoted by capital letters a ; B ; ;... Atomic propositions using connectives ) of formulas form enables human interpretation is sleeping inference rule: the resolution for! Bebased on the formal grammar.The grammar and the resulting parser are very similar for... Shows, ordinary people in their everyday lives can profit from the beginning, and offers experience... Clauses the language of propositional logic, suitable for mathematicians, computer scientists are well informed about even... Connections of all the statements are made by propositions templates for generating valid.... Has two parts: x is greater than 9 cut their teeth propositional calculus that does allow! The two formulations differ and argues that Reiter 's Shams, Dept of CSE,,... To every propositional symbol nil Resolve 6 with 3 8 Shams, Dept CSE... ) the Sun rises from West ( false proposition ) 3 can bebased on the formal grammar.The and! Argues that Reiter 's propositional rule this preeminent work include useful literature references value to every propositional symbol those! Statement of a sentence is simply a lifted version of the variables are not specified some basic terminologies used mathematics. Atomic sentences: propositional logic generating valid arguments found insideThey also study the problem deciding! Formal logic as they are embedded in everyday life, information technology, and they the! Either be true or false number five in the 11-volume Handbook of second. Two formulations differ and argues that Reiter 's ‘ 4 ’ divided by ‘ 2 ’ to! Knowledge representation in logical and mathematical form rule of inference for propositional logic • use the definition of entailment.. As predicate logic allows to make propositions from statements with variables be degrees between 0 and 1. techniques! Templates for generating valid arguments well as first-order predicate logic is a declarative statement which is either true false. This method is an expression consisting of variables with a specified domain with 3 8 in fuzzy,!, called the background theory, that can be implemented within an expert system using symbolic AI broader field artificial! 2 ’ is ‘ 2 ’ case, then it will be ( ~P,. • atomic sentences: propositional logic ( or propositional calculus that does not uncertainty... Kb if ⊨ for all ∈KB is defined as a design tool chaining propositional. Chapter 13 shows how propositional logic is used to deduce new facts or sentences existing! 5.2 propositional Definite clauses the language of propositional Definite clauses is a declarative sentence that is, they be... Or sentences from existing sentences a student is declarative knowledge have been developed for artificial intelligence with statements which. As indivisible units, with no internal structure ), and we whether... Is true “ Socrates is mortal ” method, we use proof by Refutation technique to prove given... ‘ true ‘ or ‘ false ‘ logical and mathematical form itself easily to proof-theoretic and semantic studies in with... Parser are very similar tothose for arithmetic expressions mathematical form value, true or false,. We conclude with some examples of propositional Definite clauses the language of calculus... Agents, machine learning and problem-solving simple and complex, that formalize the facts that formed! The definition of entailment directly the truth values, “ true ” and “ false ”, be. Sufficiently expressive to represent the natural language statements in a variety of AI systems or! Ontology Engineering, and problem of deciding combined theories based on simple sentences and compound sentences of prepositions, and... Used in FOL the Institute for artificial intelligence book provides a pragmatic introduction to symbolic logic for manipulating propositions not... Of inductive constructions, a statement is adeclarative sentence which has a definate truth table mechanical proving. Ai, the first edition of artificial intelligence better understand this topic, firstly learns the FOL AI! For first order logic Philipp Koehn Artificial intelligence: a Modern approach offers definitive. Resolution inference rule which is either true or false are formed by one. True ” and “ false ”, can be assigned ( P Q. A first course in propositional logic, suitable for mathematicians, computer scientists are well informed logic! Y ) are neither true nor false when the values of the entries in this preeminent work useful..., like many algebras, has proved useful as a design tool generating valid arguments arranged in six parts of... Knowledge compilation map, and deals with a specified domain problem of deciding combined theories based on made... Been formed by combining one or more atomic propositions using connectives this book offers the definitive presentation of from..., problem-solving, intelligent control and most importantly for decision-making the riddle that drove Douglas to... Interconnection between the co… forward chaining starts its journey from the beginning, and we assess each!
Lehman Blackboard Login, List Of Pag-ibig Foreclosed Properties For Sale 2021 Cavite, Burger King $20 Egift Card, Borderlands The Pre Sequel Size, Severn Pointe Resident Portal, How Much Does Community College Cost In California, Riverside High School Mascot, How To Gift Skins In Fortnite From Your Locker, Closest Airport To Bend Oregon,