Which are needed to compute the logical inference algorithm?ans.All of the mentionedLogical equivalenceValiditySatisfiability Previous Marked for Review Next

he computational model for Logic Programs is based on a ´specific kind of Logical Inference. Which? Recursion Subsumption Resolution Unification

2. Use a tree to test whether the following two propositions are equivalent. (Present the tree, and say whether they’re equivalent or not.) If they’re not equivalent, read off from your tree a model on which the propositions have different truth values (and indicate the path from which you are reading it off). ∀x(Ax → Gx) ∃x(Ax → Gx)

17. The ___ represents facts and rules.Question 3Answera.None of theseb.Inference enginec.Knowledge based.Operating system

Given Similar as Valid InferenceIf p, Then q   If ~q, Then ~pOnly If p, Then q If q, Then p If ~p, Then ~qUnless p, Then q If ~p, Then q If ~q, Then pEither p or q    If ~p, Then q   If ~q, Then p

Now that you have finished these two tasks, you have a working resolution algorithm and you can use the unsatisfiable function to test the satisfiability of your formulas.However, often we would like to use the resolution technique to prove not just the satisfiability or unsatisfiability of a single propositional formula, but logical consequence relationships between two propositional formulas.Your final task for this section of the worksheet is to implement an additional function inside Main.hs to do just that. This function should be pretty simple, and should make use of the existing unsatisfiable function. For this to work, you'll need to copy over your solutions from the previous problems once again.Write a function entails which takes two Formulas f and g and returns True if and only if formula g is a logical consequence of f (in which case, we would say that f entails g). Don't forget a type signature!For example:Main> entails [[Pos 'Q', Neg 'P'], [Pos 'P']] [[Pos 'Q']]TrueMain> entails [[Pos 'Q', Neg 'P']] [[Pos 'P', Neg 'Q']]False