7_constraint_satisfaction_problems by tandalalam · Pull Request #5 · sut-ai/notes

tandalalam · 2021-10-29T16:02:31Z

SepehrAsh · 2021-11-05T16:26:38Z

notebooks/7_constraint_satisfaction_problems/index.md

@@ -0,0 +1,304 @@
+Constraint Satisfaction
+==============
+- [Constraint Satisfaction](#constraint-satisfaction)


SepehrAsh · 2021-11-05T16:27:59Z

notebooks/7_constraint_satisfaction_problems/index.md

+  - [Strong k-Consistency <div id='SKC'/>](#strong-k-consistency-div-idskc)
+  - [Using problem structure <div id='PS'/>](#using-problem-structure-div-idps)
+- [Summary](#summary)
+# Introduction


You Can Improve Your Introduction, Remember You Should Provide Information For Someone Who Is New To This Topic as well as informative ones.

Introcudtion updated.

SepehrAsh · 2021-11-05T16:28:31Z

notebooks/7_constraint_satisfaction_problems/index.md

+
+![Forward checking limits](/images/3.png)
+
+## N-Queens


SepehrAsh · 2021-11-05T16:29:09Z

notebooks/7_constraint_satisfaction_problems/index.md

+
+In cases which are almost tree form, there is a minimum cutset which includes a few members. In these cases, we can use *Conditioning method*. In this method, we first assign values to variables of the cutset in different ways. Then we solve the problem for other variables (which form a tree). If we consider $c$ as the size of the cutset, this method includes $d^c$ value assignments and then solving problem for the remaining tree which we know it has $O((n-c)d^2)$ time complexity. Hence, this method has $O(d^c.(n-c)d^2)$ time complexity which is good for small $c$. 
+
+# Summary


SepehrAsh · 2021-11-05T16:30:51Z

notebooks/7_constraint_satisfaction_problems/index.md

+- Tree-structured problems can be solved in linear time.
+- Custset conditioning can make a general CSP structure to a tree-structured one. It is very efficient for small cutsets.
+- Tree decomposition technique transform the CSP into a tree of subproblems. It is very efficient if tree width of the constraint graph is small. 
+- Time complexity of CSP is related to the structure of its constraint graph. 


Please Add References.

For example : Some articles that can be used for further reading, or extra details. Also, you can add your own references.

Refrences completed.

SepehrAsh · 2021-11-05T20:36:27Z

notebooks/7_constraint_satisfaction_problems/index.md

+
+In Constraint Satisfaction Problems, we are dealing with special form of search problems. These problems try to find some search algorithms that require new conditions. The conditions are Constraints.
+
+In CSPs, we have some variables $X_i$ that we should declare some values from domain $D_i$.


Pay attention to syntax -> $X_i$, $D_i$.

used (https://render.githubusercontent.com) for rendering latex.

SepehrAsh · 2021-11-05T20:37:05Z

notebooks/7_constraint_satisfaction_problems/index.md

+# Examples
+## Map-Coloring
+
+![Forward checking limits](/images/1.png)


Check image address.

path of images changed.

SepehrAsh · 2021-11-05T20:37:33Z

notebooks/7_constraint_satisfaction_problems/index.md

+For example:
+$[WA : Red, NT : Green, SA : Blue, Q : Red, NSW : Green, V : Red, T : Green]$
+
+![Forward checking limits](/images/2.png)


Images are not shown.

SepehrAsh · 2021-11-05T20:39:44Z

notebooks/7_constraint_satisfaction_problems/index.md

+- Tree-structured problems can be solved in linear time.
+- Custset conditioning can make a general CSP structure to a tree-structured one. It is very efficient for small cutsets.
+- Tree decomposition technique transform the CSP into a tree of subproblems. It is very efficient if tree width of the constraint graph is small. 
+- Time complexity of CSP is related to the structure of its constraint graph. 


There are some syntax problems.
Check your images' paths.

add notebook

e2df60c

parhamsaremi requested review from SepehrAsh and sararajabzadeh October 29, 2021 16:40

SepehrAsh reviewed Nov 5, 2021

View reviewed changes

tandalalam and others added 9 commits November 12, 2021 22:14

test

d383b56

test

067c6e7

test

25af40e

test

1ba06eb

test

cfbf89b

test

475ffd3

final-ver

acf88cf

remove dollor signs

e78c358

Update index.yml

b43c096


		In cases which are almost tree form, there is a minimum cutset which includes a few members. In these cases, we can use Conditioning method. In this method, we first assign values to variables of the cutset in different ways. Then we solve the problem for other variables (which form a tree). If we consider $c$ as the size of the cutset, this method includes $d^c$ value assignments and then solving problem for the remaining tree which we know it has $O((n-c)d^2)$ time complexity. Hence, this method has $O(d^c.(n-c)d^2)$ time complexity which is good for small $c$.

		# Summary


		In Constraint Satisfaction Problems, we are dealing with special form of search problems. These problems try to find some search algorithms that require new conditions. The conditions are Constraints.

		In CSPs, we have some variables $X_i$ that we should declare some values from domain $D_i$.

Conversation

tandalalam commented Oct 29, 2021

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

tandalalam Nov 12, 2021 • edited Loading Uh oh! There was an error while loading. Please reload this page.

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

tandalalam Nov 12, 2021 • edited Loading Uh oh! There was an error while loading. Please reload this page.

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Reviewers

Assignees

Labels

Projects

Milestone

Development

Uh oh!

2 participants

tandalalam Nov 12, 2021 •

edited

Loading

tandalalam Nov 12, 2021 •

edited

Loading