QUESTION 7Suppose that an agent has the following sentences in its knowledge base:KB = {P=Q V R, P, -Q}On your work paper, use model-checking to compute whether the following entailment holds (is true):KB ERThen answer the following questions.How many possible worlds are there for these sentences?%3DAnswer:How many models are there of the knowledge base (KB)?Answer:How many models are there of the query?Answer:Does the query follow logically from the knowledge base? Write "yes" or "no" (without the quotes).Answer:

Answered: Suppose that an agent has the following…

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

Consider the formula B = 3x3y3z. p(x, y) ^ p(x, z) ^ ¬p(y, z). For each of the following interpretations, determine if the interpretation is a model of B. If it is a model, show that it is. If it is not a model, show that it is not. (a) D = the set of you and your friends (pick you and two other friends) R = {R1} R1 = x is-friends-with y (define explicitly!!) p maps to R1 (b) D = {1,2} R = {R1} R1 = > (you may write this out as tuples if it helps) p maps to R1
Inference in Bayesian networks is NP-hard in the worst case because it includes propositional logic inference as a special case. Write down a Bayesian network, where the nodes represent logical sentences, that implements modus ponens inference rule A ⇒ B, A infer B.
3. Consider a fuzzy inference system cosisting two fuzzy laws as follow, if u is A, and vis B₁, thenw is C₁ if u is A, and vis B₂, thenw is C₂ All the fuzzy sets are in the form of triangular (3-value) and trapizoidal (4-value) that are defined as follow, A₁ = (0,1,2, 4); B₁ = (1,3,5); C₁ = (1,2,3) A₂ = (1,3,4,6); B₂ = (0,2,4); C₂ = (2,4,6) Obtain the results of the fuzzy inference, (w), for the inputs u = 3,v₁ =1.5 using the Mamdani inference method in a precise and digramatic form.
Neural network regression of car-prices We assume that the car prices (y) can be predicted as ?=?(?) where ?=[?0..?9..] are the car features and ? is a three layer fully connected neural network. We first create the matrix X_train, whose columns are the normalized training features. Create a three layer neural network with hidden layers of h1 and h2 neurons respectively. Use RELU activations at the hidden layers and no activation on the output layer. class Net(nn.Module): def __init__(self,Nfeatures,Noutput,Nh1=10,Nh2=10): super(Net, self).__init__() # YOUR CODE HERE def forward(self, x): # YOUR CODE HERE
1. Prove that IR2 of the Armstrong Inference Rules is correct (sound). We did that for IR3 in class. Consider F = {BC -> D, B -> E, CE -> D, E -> CA, BF -> G}and R(A,B,C,D,E,F,G) for the next 6 questions. 2. Use all three of Armstrong Rules to "infer" one new FD. 3. Find a minimal cover for F. 4. Find all many keys for R. 5. Find a 3NF decomposition for R that is dependency preserving and has lossless join. 6. Find a BCNF decomposition for R that has lossless join. 7. Apply the lossless join test algorithm on the decomposition of Q6 or the decomposition of Q7 to verify that the decomposition is a lossless join decomposition. You do not need to do that for both Q6 and Q7.
An independent t-test analysis compares a randomly assigned group of 16 participants who received a psychotherapy intervention on their changes in thought suppression to a control group (n=16) who received the treatment later. Thought suppression is measured, and high scores represent higher perceived thought suppression. How should the hypotheses be written for the given test? O A Ho: Hosychotherapy Hcontrol O B. Ha Hpsychotherapy Hcontrol OC Ho: Hosychotherapy Hcontrol O D. Ha HosychotherapyFHcontral
The accuracy in the output depends on the correct inputs. The model designed is supposedto be evaluated to determine the accuracy and it is supposed to function in a supervisedway. Hence the data sets can affect the model and vice versa.Given P(D|M) ,P(M) ,and P(D'|M), solve the followinga)Draw the probability tree for the main situationB)Draw the reverse tree for the main situation.C)Using the main tree, prove all probabilities on the opposite tree.D) If P(DIM) = 0.3,P(M) = 0.1 ,and P(D'IM) = 0.65 find P(D)
For problem 2, you should provide two answers for each of the search strategies: the states expanded and the solution. Problem 2 Alice the agent wants to go skiing right after AI class is over. She starts in the lecture hall (the "Start" state below) and wants to make it to Alta (the "Goal" state) as soon as possible. There are several possible paths she can take denoted in the graph below ( refer to image ): The available actions at each state are denoted by arrows with a path cost label above each arrow. For each of the following graph search strategies, figure out the order in which states are expanded as well as the path returned by graph search. When choosing an arbitrary order of state expansions (to break ties), use alphabetical ordering. Remember that in graph search, states are expanded only once. Depth-first search Breadth-first search Uniform cost search A* search
Given the following input instance for the 0/1 Knapsack problem. Show how the algorithm given in the class works on this input instance. Complete the whole (M+1)x(n+1) table, and give the answer for the optimal solution, where M is the capacity of the knapsack and n is the number of objects. Object 1 Object 2 Object 3 Object 4 Object 5 Object 6 Profit p Weight w; | 2 3 3 5 5 1 4 4 5 3 2 5 М-10
Question 8 1 You are given a dataset consisting of images of various types of animals with labels "cat", "dog", "horse, and "pin Among the supervised learning models, which one of the following would be the most appropriate to impleme try to learn these labels and predict the labels of future images? K-means clustering Polynomial regression O Binary logistic regression Linear regression Multiclass(Softmax) logistic regression Přincipal component analysis (PCA) « Previous Quiz saved at 1
Using the Tableaux Algorithm show that the following knowledge base is inconsistent: TBOX = {AE ¬(VR.B)} ABOX = { A(a), ¬B(a), (vR.B)(a)} %3D Please show A-boxes after each iteration until end of proof.
Please don't copy Consider the following knowledge base a.Prove that Q is true with: 1. P → Q 2. L ∧ M → P 3. B ∧ L → M 4. A ∧ P → L 5. A ∧ B → L 6. A 7. B i. Forward-Chaining ii. Backward-Chaining iii. Resolution

SEE MORE QUESTIONS

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS