1 point
First order logic (FOL) is called `first order’ because
A. FOL does not allow quantification over predicate symbols or function symbols.
B. Predicates are first-order relations.
C. FOL comes first in the logics involving quantifiers.
D. Propositional logic is zero-order
1 point
The process of removing detail from a given state representation is called______
A. Extraction
B. Abstraction
C. Information Retrieval
D. Mining
1 point
First-order resolution requires the clause to be in Conjunctive Normal Form, which are
A. Disjunction of literals
B. Disjunction of variables
C. Conjunction of literals
D. Conjunction of variable
1 point
Rule of inference, called ___________ when added to resolution principle, guarantees refutation completeness, even when involving equality.
A. Demodulation
B. Paramodulation
C. Modulation
D. Equimodulation
1 point
A resolution trace captures the information of a __________ , in a linear form.
A. Domain
B. Conceptualization
C. Resolution Graph
D. Abstraction
1 point
Answer extraction involves converting a refutation tree to a proof tree with statement at the root that can be used as an answer. Which of the following are true w.r.t the above process of answer extraction:
I. Convert every clause arising from the negation of the goal well-formed formula into a tautology.
II. The statement at the root of the Modified Proof Tree logically follows from the axioms and the tautologies.
A. Either I or II
B. Both I and II
C. I only
D. II only
1 point
A control strategy for a refutation system is said to be ___________ if its use results in a procedure that will find a contradiction whenever one exists.
A. Optimal
B. Complete
C. Efficient
D. Sound
1 point
Under which of the following conditions, a clause {Li} subsumes a clause {Mi}, if there exists a substitution 's'?
Condition 1: {Li}s is a subset of {Mi}
Condition 2: {Mi}s is a subset of {Li}
A. No clause ever subsumes another clause.
B. Condition 1 only
C. Both Condition 1 and Condition 2
D. Condition 2 only
1 point
In this form of refutation, each resolvent has a parent that is either in the base set or that is an ancestor of the other parent.
A. Breadth-first Strategy
B. Ancestry-filtered Form Strategy
C. Linear-input Form Strategy
D. Set-of-support Strategy
1 point
In answer extraction, we convert the question to a goal well-formed formula containing an existential quantifier. The ___________ represents an answer to the question.
A. local variable
B. existentially quantified variable
C. global variable
D. well-formed formula
Answers
Answer:
B,B,A,B,c,B,D,B,A,B
1) First-order logic (FOL) or first-order because FOL comes first in the logic involving quantifiers. (Option C)
FOL is a deduction system that extends propositional logic by permitting quantification over persons in a specific domain, the use of quantified variables over non-logical objects, and the use of variables in sentences.
2) The process of removing detail from a given state representation is called abstraction. (Option B)
Abstraction is a sort of Artificial Intelligence issue formulation and problem-solving strategy. The abstraction process is an idea in computer science utilized as a declarative statement in several programming languages such as Java and C++.
3) First-order resolution requires the clause to be in Conjunctive Normal Form, which is Disjunction of literals. (Option A)
A literal (P or P) is a propositional or negated propositional variable. A clause is a literal disjunction.
4) Rule of inference, called paramodulation when added to resolution principle, guarantees refutation completeness, even when involving equality. (Option B)
Paramodulation in combination with the resolution is comprehensive in terms of reputation. Paramodulation can use with broad clauses. According to the new rule of inference, combining the resolution principle with paramodulation ensures full refutation for E satisfiability.
5) A resolution trace captures the information of a resolution graph, in a linear form. (Option C)
In proofs by resolution, resolution graphs explain the relevance of merges and tautologies.
6) Either I or II is true concerning the above process of answer extraction. (Option A)
7) A "control strategy for the refutation system" is said to be complete if its use results in a procedure that will 'find a contradiction' whenever one exists. (Option B)
A refutation tree with a root node built by NIL represents a resolution refutation. By looking for refutation, the control strategy generates a graph, which then develops into a refutation tree, complete with the root node.
8) Only condition 1 is correct. (Option B)
9) In Ancestry-filtered Form Strategy, each resolvent has a parent that is either in the base set or that is an ancestor of the other parent. (Option B)
It is also known as linear resolution.
10) In answer extraction, we convert the question to a goal well-formed formula containing an existential quantifier. The existentially quantified variable represents an answer to the question. (Option B)