1. Suppose a knowledge base has the following sentences Sam plays baseball or Paul plays baseball Sam plays baseball or Ryan doesn't play baseball Represent the knowledge base as a Boolean expression using propositional symbols and logical connectives Does this knowledge-base entail the following? If yes provide the reason why and if not provide a counterexample that there exists a model where KB is true but the sentence is false A. Sam and Ryan both play baseball B. At least one among Sam, Paul and Ryan play baseball

1. Suppose a knowledge base has the following sentences Sam plays baseball or Paul plays baseball Sam plays baseball or Ryan doesn't play baseball Represent the knowledge base as a Boolean expression using propositional symbols and logical connectives Does this knowledge-base entail the following? If yes provide the reason why and if not provide a counterexample that there exists a model where KB is true but the sentence is false A. Sam and Ryan both play baseball B. At least one among Sam, Paul and Ryan play baseball

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Construct direct proofs to show that the following symbolic arguments are valid. Commas mark the breaks between premises. 1. ~(J∙L), (~J v ~L)→~M, ~E v (M v ~S) ∴ ~(S∙E) 2. (B∨A)→C, ~B→D, ~D ∴ C 3. ~(O∙N), (~O→S)∙(~N→T) ∴ S v T
(a) Assume a probabilistic model is represented by the Bayesian network (I) in Figure 3. Is it then always possible to represent the model instead with the Bayesian network (I) of Figure 3? Given an argument for your answer. (b) Assume a probabilistic model is represented by the Markov network (III) in Figure 3. Is it then always possible to represent the model instead with the Bayesian network (1) of Figure 3? Given an argument for your answer. (1I) (III) B (1) D
For example, what does a perceptron network model entail? How could this model be used for straightforward linear classification, where objects are divided into two categories according to a line drawn between them and a set of two features? To demonstrate how elementary logical operations (like AND and OR) function? Which of the following logical processes does not function in a perceptron model? Which logical expression cannot be used in a perceptron model? What small adjustment could be made to the feedforward network model to make it capable of modeling all the elementary steps of logic?
5
LET X, Y, Z be atomic sentences. Given this sentence A = X → ((Y ∧ Z)∨(¬Y∧¬Z)) In what conditions is A false? (T = True, F = False) 1. X = T, Y = T, Z = T 2. X = T, Y = T, Z = F 3. X = T, Y = F, Z = T 4. X = T, Y = F, Z = F 5. X = F, Y= T, Z = T 6. X = F, Y = T, Z = F 7. X = F, Y = F, Z = T 8. X = F, Y = F, Z = F
please answer with proper explanation and step by step solution.
Answer all 3 parts
Use Conditional Proofs (CP) to show that each of the following symbolic arguments are valid. Commas mark the breaks between premises. P→(Q→R) ∴ Q→(P→R) P→Q ∴ P→(Q v R) (B∙D)→(C∙R), D ∴ B→R (Z∙~W)→(X∙U), Z→(W→Y) ∴ Z→(~Y→U) (E∨F)→G, A→[(B v C)→(D∙E)] ∴ A→(C→G)
For example, what does a perceptron network model entail? How could this model be used for straightforward linear classification, where objects are divided into two categories according to a line drawn between them and a set of two features? To demonstrate how elementary logical operations (like AND and OR) function? Which of the following logical processes does not function in a perceptron model? Which logical expression cannot be used in a perceptron model? What small adjustment could be made to the feedforward network model to make it capable of modeling all the elementary steps of logic?
2. Let p, q, r be propositions. Based on given truth values of individual propositions or compound propositions decide the missing truth value(s), if possible. Pick the correct answer (circle or underline, or use a color). No explanation is necessary. a) If p = T Aq =F Ar =T then (p → ¬q) O (p ^r) = .. TRUTH FALSE cannot be decided b) If p = T Aq = F Ar = F then (p Oq) → (q → r) = ... TRUTH FALSE cannot be decided c) If (p A-q) V (p → r) = F , then p Ar = .. TRUTH FALSE cannot be decided
Apply a series of logical equivalences and/or rules of inference to show that r → q follows from the following premises. Be sure to indicate the line number(s) and logical equivalence or rule of inference used in each step. 1. p → q 2. (r V s) → p 3. ¬s
1. A truth table constructed for the knowledge base given in the text cannot decide propositional entailment True False 2. Knowledge agents uses knowledge base and inference engine to decide what actions to take True False 3. Logics formal languages for representing information such that conclusions can be drawn its syntax defines the sentences in the language its semantics define the "meaning" of sentences Knowledge base entails sentence Î± if and only if Î± is true in all worlds where KB is true all above 4. Define predicts In(x,y) â place x is within y. The English sentence: â Dobbs and Bronx are both in NYâ can be represented by the logic expression___ In(Dobbsâ §Bronx, NY) In(Dobbsâ ¨Bronx, NY) In(Dobbs, NY)â ¨In(Bronx, NY) In(Dobbs, NY)â §In(Bronx, NY) 5. First-order logic is the same as propositional logic in terms of language expressive power. True False 6. Sentences in the first-order logic are true with respect to a model and an…