Means-End Analysis/Algorithm for resolution in predicate logic

-
MEANS -END ANALYSIS
For means-end analysis we can say its a method for AI to get our Aim or rather choose our path from initial to goal State wisely.

 So imagine about two states say state A as initial state and state F as final state .

 Now means-end analysis goes the following way;

  1. compare the Difference between the initial state and goal state.
  2. find the difference between them.
  3. for each difference look at which operators can be applied.
  4. select that operator which gets you the closest from current state to goal state.
Algorithm for resolution in predicate logic
Two literals are Contradictory  if one can be unified with the negation of the other.

for example we take 2 literals say A and B so these two literals are contradictory if A unifies with the negation of B.

In predicate logic Unification algorithm is used to locate pairs of literals that cancel out.

It is important that if two instance of same variable occur they must be given identical substitutions.

Now moving towards the algorithm .

  1. we have two sets say f and S ,f is the given statements and S is the statements to be proved.t 
  2. Convert all the statements of f into the clause form.
  3. Negate S and convert them into the clause form Add it to the set of clause of 1.
  4. Repeat until either a contradiction is found or no progress can be made or a predetermined amount of effect has been expended.
  5. select that two clauses call them as parent clauses.
  6. Resolve them together the resolvant is the dis-junction of all the literals of both clause .
  7. If there is pair of literals say T1 and T2 such that one parent clause contains T1 and other contains T2 are unifiable then neither T1 nor T2 should appear as resolvant ,Here T1 and T2 are called as Complementary literals.

Comments

Post a Comment

Popular posts from this blog

State space search / blocks world problem by heuristic approach /TIC TAC TOE

-
A lot of AI is about SEARCH. The "state space" is the set of states of the problem we can get to by applying operators to a state of the problem to get a new state. A  state  contains  all of the information necessary to predict the effects of an action and to determine if it is a goal state. State-space searching assumes that the agent has perfect knowledge of the state space and can observe what state it is in (i.e., there is full observability); the agent has a set of actions that have known deterministic effects;some states are goal states, the agent wants to reach one of these goal states, and the agent can recognize a goal state. a solution is a sequence of actions that will get the agent from its current state to a goal state. Define the Problem as State Space Search Consider the problem of “Playing Chess” . to build a program that could play chess, we have to specify the starting position of the chess board, the rules that define legal moves. And the
Read more

Navigation in Vaadin.

-
Plain Vaadin applications do not have normal web page navigation as they usually run on a single page, as all Ajax applications do. Quite commonly, however, applications have different views between which the user should be able to navigate. The  Navigator  in Vaadin can be used for most cases of navigation. Views managed by the navigator automatically get a distinct URI fragment, which can be used to be able to bookmark the views and their states and to go back and forward in the browser history. The  Navigator  class manages a collection of  views  that implement the  View  interface. SO the class in which you are defining Navigation must implement with a  View  interface. addView() i s the method by which you can register Your View . You can add your view at any point ,Your View must have   name identifier and be added to a  View . Once registered, you can navigate to them with  navigateTo() . Navigator  manages navigation in a component container, which can be
Read more

Drag and drop items from one Grid to another

-
Following is a short example to drag and drop similar type of items from one Grid to another Grid in Vaadin 8 . package com . example . demo ; import java . util . ArrayList ; import java . util . List ; import java . util . Optional ; import com . vaadin . data . provider . ListDataProvider ; import com . vaadin . shared . ui . dnd . DropEffect ; import com . vaadin . shared . ui . dnd . EffectAllowed ; import com . vaadin . shared . ui . grid . DropMode ; import com . vaadin . ui . CustomComponent ; import com . vaadin . ui . Grid ; import com . vaadin . ui . HorizontalLayout ; import com . vaadin . ui . components . grid . GridDragSource ; import com . vaadin . ui . components . grid . GridDropTarget ; import com . vaadin . ui . renderers . ButtonRenderer ; public class DragAndDropFromGrid extends CustomComponent { /**       *      */ private static final long serialVersionUID = 1 L ; private HorizontalLayout hlytbase ;
Read more