Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 7, Problem 4E
Which of the following are correct?
- a. False |= True.
- b. True |= False.
- c. (A ∧ B) |= (A ⇔ B).
- d. A ⇔ B |= A ∨ B.
- e. A ⇔ B |= ￢A ∨ B.
- f. (A ∧ B) ⇒ C |= (A ⇒ C) ∨ (B ⇒ C).
- g. (C ∨ (￢A ∧ ￢B)) ≡ ((A ⇒ C) ∧ (B ⇒ C)).
- h. (A ∨ B) ∧ (￢C ∨￢D ∨ E) |= (A ∨ B).
- i. (A ∨ B) ∧ (￢C ∨￢D ∨ E) |= (A ∨ B) ∧ (￢D ∨ E).
- j. (A ∨ B) ∧ ￢ (A ⇒ B) is satisfiable.
- k. (A ⇔ B) ∧ (￢A ∨ B) is satisfiable.
- l. (A ⇔ B) ⇔ C has the same number of models as (A ⇔ B) for any fixed set of proposition symbols that includes A, B, C.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The following formula is not a tautology:
(((B⇒C) ^ ¬(B⇒ A)) ⇒ ¬(C' ^ D⇒ A))
Find an interpretation that makes the formula false. Then copy the interpretation below, checking all and only the propositional
symbols that are true.
A
B
D
Write TRUE if the statement is true, otherwise, write FALSE.
The statement (¬P ∨ Q) ∧ (¬Q ∨ P) is a contradiction.
Let A
{c, e,j, l, s, u, y, z}, which of the following is true? There may be more than one correct answer.
OA. Ø C A
B. {q,f, v, d} C A
C. AC {I, y, s, u}
D. {I, y, s, u} = {u, s, 1, y}
E. {1, y, s, u} C A
F. {u, s, 1, y} C {I, y, s, u}-
OG. {e, s, l, g} CA
Chapter 7 Solutions
Artificial Intelligence: A Modern Approach
Ch. 7 - Suppose the agent has progressed to the point...Ch. 7 - (Adapted from Barwise and Etchemendy (1993).)...Ch. 7 - Prob. 3ECh. 7 - Which of the following are correct? a. False |=...Ch. 7 - Prob. 5ECh. 7 - Prob. 6ECh. 7 - Prob. 7ECh. 7 - We have defined four binary logical connectives....Ch. 7 - Prob. 9ECh. 7 - Prob. 10E
Ch. 7 - Prob. 11ECh. 7 - Prob. 12ECh. 7 - Prob. 13ECh. 7 - Prob. 14ECh. 7 - Prob. 15ECh. 7 - Prob. 16ECh. 7 - Prob. 17ECh. 7 - Prob. 18ECh. 7 - A sentence is in disjunctive normal form (DNF) if...Ch. 7 - Prob. 20ECh. 7 - Prob. 21ECh. 7 - Prob. 23ECh. 7 - Prob. 24ECh. 7 - Prob. 25ECh. 7 - Prob. 26ECh. 7 - Prob. 27E
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Suppose you change Self-Test Exercise 15 so that the definition of the class Automobile omits the line that con...
Problem Solving with C++ (10th Edition)
What Ada construct provides support for abstract data types?
Concepts Of Programming Languages
Latin Translator Look at the following list of Latin words and their meanings: Latin English sinister left dext...
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
A file that contains a Flash animation uses the __________ file extension. a. .class b. .swf c. .mp3 d. .flash
Web Development and Design Foundations with HTML5 (8th Edition)
As in the text discussion, suppose that an airplane maintains a heading toward an airport at the origin. If v0=...
Differential Equations: Computing and Modeling (5th Edition), Edwards, Penney & Calvis
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Q. There is an island that has two kinds of inhabitants, knights, who always tellthe truth, and their opposites, knaves, who always lie. It is assumed that every inhabitant of theisland is either a knight or a knave. Below there are 3 inhabitants, who are denoted by A, B andC.A. What are A, B and C if A says “If B is a knave then C is a knave”, and B says “If Cis a knight then A is a knave”? Briefly explain your reasoning.B. What are A,B and C if A says “B is a knight and C is a knight”, and B says “A is aknight if and only if C is a knave”? Briefly explain your reasoning.arrow_forward8. Let ?, ?, and ? be true, false and false, respectively. Determine the truth value of the following? a.) (? → ?) ∧∼ ? b.) ? ↔ (? ∧ ?)arrow_forward3. Let K(x) be the statement “x has a pet koala,” let G(x) be the statement “x has a gazelle," let U(x) be the statement "x has a unicorn," and let F(x) be the statement "x has a farm." Express each of these statements in terms of K(x), G(x), U(x), F(x), quantifiers, and logical connectives. Let the domain consist of all people. (a) Everyone owns a gazelle or a unicorn. (b) Any person who does not own a farm cannot own a koala, gazelle, or unicorn. (c) No one owns a gazelle, but everyone owns a koala. (d) Some people own both a unicorn and a farm, but not all people own both a koala and a gazelle. (e) Each type of animal (koala, gazelle, unicorn) is owned by at least one person.arrow_forward
- Suppose that p and q are statements so that p → q is false. Find the truth values of each of the following. (a) ~p → q TrueFalse (b) p ∨ q TrueFalse (c) q → p TrueFalsearrow_forwardIf a, b, and c are the three sides of a triangle, then its area is, Area = √[s(s-a)(s-b)(s-c)] Here, "s" is the semi-perimeter of the triangle, i.e., s = (a + b + c)/2. However to be a valid triangle “the summation of any two sides should be greater than the third side.” i) Now Design a Class Triangle with a method checkValid() that returns true if it satisfies the criteria of a valid triangle. ii) Write down a method throwException() that uses the checkValid() and throws OwnException as described below. iii) Your own Exception class OwnException will throw an Exception if the valid triangle criteria is not satisfied with the information of “Not a real triangle” with the values of three sides. iv) A triangle object can be only instantiated with the value of three sides if it is a valid triangle otherwise an exception will be thrown. Similarly changing the sides of a triangle is possible if it satisfies the above criteria otherwise an exception will be thrown. v) In the Driver Class get…arrow_forwardX Bird(x)=Can- Fly(x) This universal quantifier used here implies that All reptiles cannot fly Oa. Ob. Ob. All that flies is a Bird All Birds can fly Oc. All chicken are birds d.arrow_forward
- Note that for this question, you can in addition use ``land'' for the symbol ∧ ``lor'' for the symbol ∨ ``lnot'' for the symbol ¬. Given the following three sentences:A) Every mathematician is married to an engineer.B) A bachelor is not married to anyone.C) If George is a mathematician, then he is not a bachelor. a) Convert A,B,C into three FOL sentences, whereMn(x): x is a mathematician.Er(x): x is an engineer.Md(x,y): x is married to y.Br(x): x is a bachelor.george: George is a constant. b) Show that A does-not-entail C. (Hint: Consider defining an interpretation I such that I models A, but does-not-model C.)c) Show that {A,B} entails C. (Hint: For a given interpretation I, consider two difference cases, the case where Mn(george) is true, and the case Mn(george) is false. For both cases, argue that it is always that I models C).d) Convert A,B, lnot C into a set of clausal forms, number your clauses. (Note that C is negated here!) e) Derive the empty clause from the set of clauses…arrow_forwardGiven L = {w = {a, b}*: |w| is even}, the correct statements are: (aa U ab Uba U bb)* is a regular expression that generates L. (ab Uba)* is a regular expression that generates L. aa U ab U ba U bb is a regular expression that generates L. ab U ba is a regular expression that generates L.arrow_forwardRequired: Amitabh had a magical cat. That cat once fell down an empty well. As the walls of the well were not completely vertical, the cat could climb up the well. In one day, the cat can climb 1 unit height and the height of the well is h units. The cat starts at the bottom. Every day, a cat would divide into 2 cats. One of them would climb up 1 unit. The other would wait for help. But while waiting it would fall asleep and roll down 1 unit, unless it is already at the bottom, in which case it just remains there. When a cat would reach the top, it would run home toAmitabh. (Schrodinger doesn't know that some of the cats are in a well and so he can't rescue them). It has been d days since the cat fell into the well. How many cats would come out of the well today? You would notice that the number of cats grows very large with each passing day, so output the answer modulo 10^9+7. d = 0 means that the cat has fallen just now and so there's just one cat at the bottom of the well. So you…arrow_forward
- Correct answer will be upvoted else downvoted. Computer science. decimal portrayal of x without driving zeroes comprises of a digits; the decimal portrayal of y without driving zeroes comprises of b digits; the decimal portrayal of gcd(x,y) without driving zeroes comprises of c digits. gcd(x,y) indicates the best normal divisor (GCD) of integers x and y. Output x and y. In case there are various replies, output any of them. Input The primary line contains a solitary integer t (1≤t≤285) — the number of testcases. Every one of the following t lines contains three integers a, b and c (1≤a,b≤9, 1≤c≤min(a,b)) — the necessary lengths of the numbers. It very well may be shown that the appropriate response exists for all testcases under the given limitations. Extra requirement on the input: all testcases are unique. Output For each testcase print two positive integers — x and y (x>0, y>0) to such an extent that the decimal portrayal of x without…arrow_forwardI. Let P (x) be the statement “2x = x2 .” If the domain consists of the integers, what are the truth values? a) P(0) b) P(1) c) P(2) d) P(−1) e) ∃x P(x) f ) ∀x P(x) 2. Let Q(x) be the statement “x > x - 1.” If the domain consists of all integers, what are the truth values? a) Q(10) b) Q(−2) c) Q(999) d) ∃x Q(x) e) ∀x Q(x) f) ∃x ˺Q(x) g) ∀x ˺Q(x)arrow_forwardLet the statement p be true and q be false. What are the truth values of the following? Show allneeded work.a. ~p → q b. p ∧ ~qarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Introduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7); Author: CS Dojo;https://www.youtube.com/watch?v=D6xkbGLQesk;License: Standard YouTube License, CC-BY