Types of reasoning - first-order logic, Computer Engineering

Assignment Help:

Types of reasoning - First-order logic:

Atleast five types of reasoning can be acknowledged here.

• Firstly, why and how do we will think for the killer usually left a silk glove at the murder scene? Now, this means, that because Holmes has observed a glove at each of the murders and most basically guessed in which they have something to do with the murder simply by usually there. So other than it can be reasoning that's called inductive reasoning, wherever a hypothesis has been induced from some data and concept. Of course now, we will cover this in the lectures on machine learning.

• Secondly, Holmes used abductive reasoning to dredge from his past experience the explanation in which the gloves are left by the murderer as a calling card. So we don't actually wrap up abductive reasoning in general at this quality course, unfortunately.

• Thirdly, Sherlock tracked down the only three few people who bought the exacting type of glove left at the scene. Just because this can be seen - perhaps quite loosely - as model generation, in which plays a part in the reasoning process. Models are probably generated to prove existence of them, by providing a counterexample to it or often to disprove a hypothesis. We must cover up model generation in brief detail.

• Fourthly, Sherlock managed to attain alibis for two suspects, nevertheless for the third. So rather than, he ruled out two possibilities leaving only one. This can be admire as constraint-based on reasoning, according to that we will cover this in the lecture on constraint solving.

• Finally, Sherlock had two pieces of knowledge that he think for the world, which he assumed were true: (i) the killer leaves a silk glove (ornament) at the murder scene (ii) the only person who could have left a glove was Sergeant Heavyset. Instead using this knowledge we can justify, he used deductive reasoning to infer the fact that the killer must be Heavyset himself. It's so obvious that we hardly see it as a reasoning step, but it is one: it's called using the Modus Ponens rule of inference, which we cover in the lectures on automated reasoning following this one.


Related Discussions:- Types of reasoning - first-order logic

Ai6301 - building blocks and techniques used in ai, The princess (or princ...

The princess (or prince if you're female) has been captured by the Evil Dragon and held prisoner in a tower. The tower is also surrounded by a maze to keep out the riff-raff. You

Explain the hamiltonian path, What is Hamiltonian path?  A Hamiltonian ...

What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes by each node exactly once. We consider a special case of this difficulty where

Explain the working of a 3-bit D/A converter, With the help of R-2R binary ...

With the help of R-2R binary network, explain the working of a 3-bit D/A converter and derive an expression for the output voltage. Ans: We see a 3-bit R-2R ladder D/A netwo

Define dynamic linking, Define dynamic linking.  Dynamic linking is sam...

Define dynamic linking.  Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually us

Types of e-commerce , Types E-commerce generally based on advertising, sell...

Types E-commerce generally based on advertising, selling, marketing and buying, but due to the differences in needs, e-commerce has been classified according to the parties of the

Creation deductive inferences, Creation Deductive Inferences : Here we...

Creation Deductive Inferences : Here we have shown how knowledge can be represented in first-order logic or how rule-based expert systems expressed in logic can be constructed

Recombination and mutation, Recombination and Mutation: In such a scen...

Recombination and Mutation: In such a scenario the point of GAs is to generate population after population of individuals that represent possible solutions to the problem at h

Implemented in a program developed for sorting , A student counted up the n...

A student counted up the number of statements implemented in a program developed for sorting n integers and came up with a recurrence of the form: T(n) = a * n + b + 2T(n/2), an

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd