Computer Science, asked by kupriyawanjari, 9 months ago

___________ helps immensely in search as it dramatically reduces the number of resolvents that can be inferred from two input clauses.

A. Conjunctive Normal Form

B. Most General Unifiers

C. Resolution 

D. Breadth-first Strategy

Answers

Answered by charlie1505
4

Explanation:

A)Conjunctive Normal Form

Answered by Agastya0606
0

Answer:

From the above given options , the thing that helps in search immensely by reducing the number of resolvents dramatically, which can be inferred from two input clauses is option A) Conjunctive Normal Form.

When there is a conjunction of one or more clauses in Boolean logic, that formula is said to be in Conjunctive Normal Form.

Conjunctive Normal Form is usually represented as AND or OR.

Used in circuit theory and proving theorems which are automated.

Similar questions