Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 7, Problem 19E
A sentence is in disjunctive normal form (DNF) if it is the disjunction of conjunctions of literals. For example, the sentence (A ∧ B ∧ ¬C) ∨ (¬A ∧ C) ∨ (B ∧¬C) is in DNF.
- a. Any propositional logic sentence is logically equivalent to the assertion that some possible world in which it would be true is in fact the case. From this observation, prove that any sentence can be written in DNF.
- b. Construct an
algorithm that converts any sentence in propositional logic into DNF. (Hint: The algorithm is similar to the algorithm for conversion to CNF given in Section 7.5.2.) - c. Construct a simple algorithm that takes as input a sentence in DNF and returns a satisfying assignment if one exists, or reports that no satisfying assignment exists.
- d. Apply the algorithms in (b) and (c) to the following set of sentences:
A ⇒ B
B ⇒ C
C ⇒ ¬A.
- e. Since the algorithm in (b) is very similar to the algorithm for conversion to CNF, and since the algorithm in (c) is much simpler than any algorithm for solving a set of sentences in CNF, why is this technique not used in automated reasoning?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
a) Let Γ be a set of sentences of L1 (the language ofpropositional logic) and let φ be a sentence of L1.Consider:If the argument from Γ to φ is not valid, theargument from Γ to ¬φ is valid.Is this claim correct? Why or why not?
Exercise 1 Let B be a set of Boolean variables and P be a propositional logic formula over B. If P always evaluates to 1, no matter than assignments to each b ∈ B, then P is called a tautology. Formulate this definition as an expression in first order predicate logic.
Part 1: Proof-Theoretic Concepts Show that each of the following pairs of sentences are provably equivalent in SL
1. P → R, ¬R → ¬P
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
(Move the ball) Write a program that moves the ball in a pane. You should define a pane class for displaying th...
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
What are the potential consequence of inappropriate indexing decisions?
Modern Database Management
What are some features of specific programming languages you know whose rationales are a mystery to you?
Concepts Of Programming Languages
Carefully describe the process of program testing.
Problem Solving with C++ (9th Edition)
Type in and run the six programs presented in this chapter. Compare the output produced by each program with th...
Programming in C
Code an SQL statement that creates a table with all columns from the parent and child tables in your answer to ...
Database Concepts (8th Edition)
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
- Translate the given sentence into a logical expression involving quantifiers, predicates, and logical connectives. Specify a simple domain (ex. "People") and the English statement that each predicate represents. 1. Everyone who lives in the United States has a relative who lives in another country.arrow_forwardConvert each of the following argu- ments into formal statements, e.g., define sentences existentially and/or universally quantified statements. Then determine which rules of logic have been applied and explain whether or not they have been ap- plied correctly.arrow_forwardConsider a First-Order Logic (FOL) language L with two unary predicate symbols P and Q, one unary function f, and two constants a and b. The following KB has been specified in this language (note that I use directly "for all" to stand for the logical quantifier of "for-all"). 1. (forall x)(Q(x) -> P(x)) (Note: the sentence is logically equivalent to (forall x) (~ Q(x) \/ P(x))).2. P(b)3. Q(b) 4. Q(f(a)) 5. P(f(b)) Consider an interpretation of <D, I>, where D={d1, d2, d3}, and d1 is denoted by a, d2 is denoted b. For the function f, I(f,d1)=d2, I(f,d2)=d3, I(f,d3)=d1. and I(P)={d1, d2}, I(P)={d1, d2}. Is this interpretation a model of L?arrow_forward
- How to Draw a first-order predicate logic proposition for complete sentences?arrow_forwardIn the context of Propositional Logic, using letters to denote sentences components, translate the following compound sentences into symbolic notation. In the translation indicate clearly the meaning of each propositional letter: A. Roses are red and violets are blue. B. Whenever violets are blue, roses are red and sugar is sweet. C. Roses are red only if the violets are not blue and the sugar is sour. D. Roses are red and if sugar is sour then violets are not blue or sugar is sweetarrow_forwardConsider the predicates Martian (x): x is a MartianisGreen(x): x is green Use equivalence laws of first-order logic to identify the expression that is logically equivalent to ∀x (Martian(x) ˄ isGreen(x)) Group of answer choices ∃x (Martian(x)) ˅ ∃x (isGreen(x)) ∃x (¬Martian(x)) ˄ ∃x (¬isGreen(x)) ∀x (Martian(x)) ˄ ∀x (isGreen(x)) ∀x (¬Martian(x)) ˄ ∀x (¬isGreen(x))arrow_forward
- Consider the wffs:φ1 ≡ p1 → (p2 → (p3 → p4))φ2 ≡ (p1 ∧ p2 ∧ p3) → p4(a) Technically speaking, neither φ1 nor φ2 is well-formed since neither is allowed by the formal syntaxof propositional logic. Correct them. Note, however, that we will freely make such trivial ’errors’ throughout this semester (as do most such courses).(b) Use truth tables (in the form defined in this course) to show that φ1 ↔ φ2.(c) After internalizing an intuitive understanding of this equality, propose an extension of it to n atoms.(d) State the number of rows in a truth table for proving the extensionarrow_forwardConsider the wffs:φ1 ≡ p1 → (p2 → (p3 → p4))φ2 ≡ (p1 ∧ p2 ∧ p3) → p4(a) Technically speaking, neither φ1 nor φ2 is well-formed since neither is allowed by the formal syntaxof propositional logic. Correct them. Note, however, that we will freely make such trivial ’errors’throughout this semester (as do most such courses).(b) Use truth tables (in the form defined in this course) to show that φ1 ↔ φ2.(c) After internalizing an intuitive understanding of this equality, propose an extension of it to natoms.(d) State the number of rows in a truth table for proving the extension.arrow_forwardPlease Help with the question below: Suppose you are given some facts in First-Order Logics: a) Andi is a professor b) All professors are people. c) Ani is the dean. d) All Deans are professors. e) All professors consider the dean a friend or don’t know him. f) Everyone is a friend of someone. g) People only criticize people that are not their friends. h) Andi criticized Ani. Prove that: Ani is not Andi’s friend.arrow_forward
- What is the difference between ‘⊢’ and ‘⊨’. In giving your answer, briefly describe the two (equivalent) notions of validity we have given for truth-functional logic. (2-4 sentencesarrow_forwardDoes the fact ¬Spouse(George,Laura) follow from the facts Jim≠George and Spouse(Jim,Laura)? If so, give a proof; if not, supply additional axioms as needed. What happens if we use Spouse as a unary function symbol instead of a binary predicate?arrow_forwardSimplify using the Logical Equivalence Laws or Algebra of Propositions. Do not simplify by indicating the binaries. 22. (~P -> (P -> Q)) -> (Q -> (P -> P))arrow_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 EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable 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
Boolean Algebra - Digital Logic and Logic Families - Industrial Electronics; Author: Ekeeda;https://www.youtube.com/watch?v=u7XnJos-_Hs;License: Standard YouTube License, CC-BY
Boolean Algebra 1 – The Laws of Boolean Algebra; Author: Computer Science;https://www.youtube.com/watch?v=EPJf4owqwdA;License: Standard Youtube License