The Gateway to Computer Science Excellence
+3 votes
628 views

In constraint satisfaction problem, constraints can be stated as

  1. Arithmetic equations and inequalities that bind the values of variables
  2. Arithmetic equations and inequalities that does not bind any restriction over variables
  3. Arithmetic equations that impose restrictions over variables
  4. Arithmetic equations that discard constraints over the given variables
in Others by Veteran (105k points)
retagged by | 628 views

2 Answers

+2 votes
Answer A

remember map coloring problem, it is a Constraint satisfaction problem.

We need mathematical equations and inequalities. So C and D are not the answer.

Inequalities are must to check whther constraintes are fullfilled.

Equation specify the constarint.

In a nutshell, A should be the proper choice
by Boss (33k points)
+2 votes
clearly ans is A  constraints satisfaction probems like cryptoarithmetic  problem(e.g. CROSS +ROAD =DANGER or SEND+MORE=MONEY) bind values of alphabets from 0 to 9  and there are equations and inequality which imposes these restrictions
by Boss (49.3k points)
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,287 answers
198,196 comments
104,874 users