From 45b3f113079295c1c78565440c1786c45a66a9e5 Mon Sep 17 00:00:00 2001
From: Avik Jain <30073708+Avik-Jain@users.noreply.github.com>
Date: Tue, 5 Mar 2019 23:22:33 +0530
Subject: [PATCH 1/4] Update glossary.md

updated AND-parallelism glossary
---
 glossary.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/glossary.md b/glossary.md
index 07ad93e..c5eee4c 100644
--- a/glossary.md
+++ b/glossary.md
@@ -52,6 +52,8 @@ This is in contrast to a passive learning agent, which learns from its observati
 
 ## actor
 
+
+
 ## adaptive dynamic programming
 
 Also known as Approximate Dynamic Programming; it is a type of Reinforcement Learning where local rewards and transitions depend on unknown parameters - we set an initial control policy and update it until it converges to an optimal control policy.
@@ -126,6 +128,8 @@ In propositional logic, conjunction elimination (also called and elimination, 
 
 ## AND-parallelism
 
+In parallel logic programming, AND-parallelism is one of the two types of of parallelism. In AND-parallelism, the portions of conjunctive goal are pursued in parallel.
+
 ## angelic nondeterminism
 
 A notional ability always to choose the most favorable option, in constant time. With angelic non-determinism, any problem in NP would be solvable in polynomial time.

From 085618d4bd2f8b97dde3765b40412d6123d93551 Mon Sep 17 00:00:00 2001
From: Avik Jain <30073708+Avik-Jain@users.noreply.github.com>
Date: Tue, 5 Mar 2019 23:33:35 +0530
Subject: [PATCH 2/4] Update glossary.md

Updated glossary for best-first search
---
 glossary.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/glossary.md b/glossary.md
index c5eee4c..9ac8ee2 100644
--- a/glossary.md
+++ b/glossary.md
@@ -52,8 +52,6 @@ This is in contrast to a passive learning agent, which learns from its observati
 
 ## actor
 
-
-
 ## adaptive dynamic programming
 
 Also known as Approximate Dynamic Programming; it is a type of Reinforcement Learning where local rewards and transitions depend on unknown parameters - we set an initial control policy and update it until it converges to an optimal control policy.
@@ -286,6 +284,8 @@ Beam search is a heuristic search algorithm that explores a graph by expanding t
 Benchmarking is to measure the quality of something for the purposes of comparison or evaluation.
 
 ## best-first search
+
+Best-first search is a search technique of combining the advantages of both depth-first and breadth-first into a single search.
 ## biconditional
 ## binary constraint
 ## binary resolution

From 8d4ab9f18553aced05cc298b8a261b66949c0001 Mon Sep 17 00:00:00 2001
From: Avik Jain <30073708+Avik-Jain@users.noreply.github.com>
Date: Tue, 5 Mar 2019 23:42:33 +0530
Subject: [PATCH 3/4] Update glossary.md

Updated glossary for Blocks World
---
 glossary.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/glossary.md b/glossary.md
index 9ac8ee2..92254fe 100644
--- a/glossary.md
+++ b/glossary.md
@@ -286,6 +286,7 @@ Benchmarking is to measure the quality of something for the purposes of comparis
 ## best-first search
 
 Best-first search is a search technique of combining the advantages of both depth-first and breadth-first into a single search.
+ 
 ## biconditional
 ## binary constraint
 ## binary resolution
@@ -293,6 +294,9 @@ Best-first search is a search technique of combining the advantages of both dept
 ## binocular stereopsis
 ## biological naturalism
 ## blocks world
+
+Blocks world is an example domainin which there is a flat surface on which blocks can be placed .There are anumber of square blocks, all of same size. They can be stacked upon one another. There is a robotic arm that can manipulate the blocks.
+
 ## bluff
 ## body
 ## boid

From 0b1e3680f888245e9f0b59791a97c49500f7539e Mon Sep 17 00:00:00 2001
From: Avik Jain <30073708+Avik-Jain@users.noreply.github.com>
Date: Tue, 5 Mar 2019 23:42:55 +0530
Subject: [PATCH 4/4] Update glossary.md

Updated glossary for Blocks World