Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.
a) P complete
b) NP complete
c) NP hard
d) Domain dependent
No Answer is Posted For this Question
Be the First to Post Answer
Which is the best way to go for game playing problem?
What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic
Why do we use robots in the industry?
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) Only a) and b)
What do you understand by numerical control?
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals
a) PROLOG b) Java c) LISP d) Perl e) Java script
What does a hybrid bayesian network contain?
What are the capabilities of expert systems?
What are industrial robots?
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit
AI Algorithms (74)
AI Natural Language Processing (96)
AI Knowledge Representation Reasoning (12)
AI Robotics (183)
AI Computer Vision (13)
AI Neural Networks (66)
AI Fuzzy Logic (31)
AI Games (8)
AI Languages (141)
AI Tools (11)
AI Machine Learning (659)
Data Science (671)
Data Mining (120)
AI Deep Learning (111)
Generative AI (153)
AI Frameworks Libraries (197)
AI Ethics Safety (100)
AI Applications (427)
AI General (197)
AI AllOther (6)