Prior conditions - logic programs, Computer Engineering

Prior Conditions - Logic programs:

However firstly there we must make sure that our problem has a solution. Whether one of the negative examples can be proved to be true from the background information alone so then clearly any hypothesis that we find will not be able to compensate for this or the problem is not satisfiable. Thus we now utilise to check the prior satisfiability of the problem as:

\/e in E- (B e).

Moreover any learning problem that breaks the prior satisfiability condition has inconsistent data so then the user should be made aware of this. Conversely notice that this condition does not mean there like B entails that any negative example is false that's why it is certainly possible to find a hypothesis that along with B entails a negative example.

In fact in addition to checking whether we will be able to find a solution to the problem that we also have to check there the problem isn't solved already by the background information. It means that if the problem satisfies the prior satisfiability condition and each of positive example is entailed through the background information so the background logic program B would itself perfectly solve the problem. Thus we need to check that at least one positive example that cannot be explained by the background information B.

Posted Date: 1/10/2013 7:36:06 AM | Location : United States







Related Discussions:- Prior conditions - logic programs, Assignment Help, Ask Question on Prior conditions - logic programs, Get Answer, Expert's Help, Prior conditions - logic programs Discussions

Write discussion on Prior conditions - logic programs
Your posts are moderated
Related Questions
What is the maximum number of fragments that can result from a single IP Datagram? Explain. To fragment a datagram for transmission across a network, a router utilizes the netw

A v o iding Over fitting - Artificial intelligence As  we  discussed  in  the last  lecture,  over fitting  is  a  normal  problem  in machine learning. Decision trees suffe

Define Congestion. Congestion: This is uneconomic to give sufficient equipment to carry all the traffic which could possibly be offered to a telecommunication system. Inside

What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes through every node exactly once. We consider a special case of this problem whe

design a basic computer

What are the two primary models of Supply Chain Management? The Two Primary models of Supply Chain Management are:- 1.  Porter's Value Chain Model 2. Supply Chain Model

Objectives After going through this unit, you should be able to: Describe the diffrent criteria on which classification of parallel computers are based; Examine the

What is Branch prediction logic Branch prediction logic in Pentium: Pentium microprocessor uses branch prediction logic to decrease the time needed for a branch caused by in

A grammar for a programming language is a formal description of ? Structure is a formal description for a programming language.

How speech is transmitted in a digital switching environment using PCM/TDM? A digital carrier system is a communications system which uses digital pulses quite than analogue si