Explore topic-wise InterviewSolutions in .

The CORRECT ANSWER is (a) NEGATION as failure

For EXPLANATION: NONE.

The correct choice is (B) EXPRESSING knowledge in a formal language

For explanation: Logic programming can be CONSTRUCTED by expressing knowledge in a formal EXPRESSION and the problem can be solved by running INFERENCE process.

The CORRECT answer is (a) Depth-first search algorithm

The best I can EXPLAIN: It is depth-first search algorithm because its SPACE requirements are LINEAR in the SIZE of the proof.

Right answer is (b) Substitutes matching the QUERY

To elaborate: It will contains the list of goals containing a single element and RETURNS the SET of all SUBSTITUTIONS SATISFYING the query.

Right answer is (c) LOGIC PROGRAMMING

For EXPLANATION: Logic programming is mainly used to check the WORKING process of the system.

Right ANSWER is (b) Backward chaining

To explain I WOULD say: Backward chaining algorithm will WORK backward from the GOAL and it will chain the known facts that support the proof.

Right ANSWER is (b) Conjunct ordering

The best explanation: Conjunct ordering will find an ordering to solve the conjuncts of the RULE PREMISE so that the total cost is MINIMIZED.

Right answer is (b) Incremental FORWARD chaining

The best I can EXPLAIN: We can eliminate the redundant RULE matching ATTEMPTS in the forward chaining by using incremental forward chaining.

Correct ANSWER is (b) No function symbols

To elaborate: If the knowledge BASE contains no function symbols MEANS, it is an INSTANCE of the class DATALOG knowledge base.

The CORRECT option is (C) Generalized modus ponens

To elaborate: Definite clauses are a suitable NORMAL form for use with generalized modus ponen.

Right OPTION is (d) First-order definite clauses

Explanation: Because they are disjunction of LITERALS of which EXACTLY one is positive.

The correct ANSWER is (c) No further inference

To EXPLAIN: FORWARD chain can grow by adding NEW atomic SENTENCES until no further inference is made.

The correct ANSWER is (b) Universally quantified

Best explanation: First-order LITERALS will ACCEPT VARIABLES only if they are universally quantified.

Correct answer is (B) Sentence is unsatisfiable

For explanation I would SAY: RESOLUTION is refutation-complete, if a set of sentence is unsatisfiable, then resolution will ALWAYS be ABLE to derive a contradiction.

Right option is (C) Reduced to one

For explanation I would say: Propositional factoring REDUCES two literals to one if they are identical.

The correct choice is (b) REMOVAL of redundant literal

The explanation: NONE.

The correct choice is (a) PROPOSITIONAL resolution RULE

Explanation: The resolution rule for first-order CLAUSES is simply a LIFTED VERSION of the propositional resolution rule.

The correct option is (d) Original STATEMENT

The BEST EXPLANATION: The CNF statement will be unsatisfiable just when the original SENTENCE is unsatisfiable.

Correct answer is (c) EVERY sentence of first-order logic

For EXPLANATION I would say: Every sentence of first-order logic can be converted to inferred equivalent CNF sentence.

The CORRECT choice is (B) Universally QUANTIFIED

Easiest explanation: Literals that CONTAIN variables are assumed to be universally quantified.

Right OPTION is (a) Disjunction of LITERALS

For explanation: First-order resolution requires the CLAUSE to be in disjunction of literals in CONJUNCTIVE NORMAL Form.

Correct ANSWER is (c) PROPOSITIONAL resolution

The explanation: Propositional resolution is a refutation COMPLETE inference PROCEDURE for propositional logic.

Correct answer is (a) CONJUNCTIVE NORMAL form

The EXPLANATION: None.

The correct choice is (b) RESOLUTION

To EXPLAIN: Because resolution yields a complete INFERENCE RULE when coupled with any search algorithm.

The correct answer is (a) Inference rule

The explanation: Inference rule contains the STANDARD PATTERN that LEADS to desired GOAL. The best form of inference rule is modus ponens.

The correct CHOICE is (a) Semantics of propositional logic

For explanation I would SAY: Because the meaning of the sentences is REALLY NEEDED to compute the truth.

Correct OPTION is (d) 5

For explanation: The five LOGICAL SYMBOLS are negation, conjunction, disjunction, implication and biconditional.

Right OPTION is (b) 2

To explain: The TWO proposition symbols are true and FALSE.

Correct OPTION is (c) LOGICAL connectives

Best explanation: NONE.

Right option is (d) All of the mentioned

Best explanation: The Löwenheim–Skolem theorem shows that if a first-order theory has any infinite model, then it has infinite models of every cardinality. In PARTICULAR, no first-order theory with an infinite model can be CATEGORICAL. Thus there is no first-order theory whose only model has the set of NATURAL numbers as its domain, or whose only model has the set of real numbers as its domain. Many extensions of first-order logic, including infinitely logics and higher-order logics, are more expressive in the sense that they do permit categorical axiomatizations of the natural numbers or real numbers. This expressiveness comes at a meta-logical cost, however: by Lindström’s theorem, the compactness theorem and the downward Löwenheim–Skolem theorem cannot hold in any logic stronger than first-order.

Formalizing Natural Languages : First-order logic is able to formalize many simple quantifier constructions in natural language, such as “every person who lives in PERTH lives in Australia”. But there are many more complicated FEATURES of natural language that cannot be expressed in (single-sorted) first-order logic.

Many-sorted Logic: Ordinary first-order interpretations have a single domain of discourse over which all quantifiers range. Many-sorted first-order logic allows variables to have different sorts, which have different domains.