Q#1: First-order logic is used to:
(A) Represent facts and relations about objects
(B) Perform random search
(C) Expand BFS only
(D) DFS depth control
Answer: (A) Represent facts and relations about objects
Q#2: FOL extends:
(A) Propositional logic
(B) Predicate calculus only
(C) Random assignments
(D) BFS nodes
Answer: (A) Propositional logic
Q#3: A predicate in FOL represents:
(A) Property or relation
(B) Variable only
(C) BFS node
(D) Random value
Answer: (A) Property or relation
Q#4: Constants in FOL refer to:
(A) Specific objects
(B) Variables
(C) Random assignments
(D) BFS nodes
Answer: (A) Specific objects
Q#5: Variables in FOL represent:
(A) Arbitrary objects
(B) Specific objects
(C) BFS nodes
(D) Random values
Answer: (A) Arbitrary objects
Q#6: Functions in FOL map:
(A) Objects to objects
(B) Variables to predicates
(C) BFS nodes
(D) Random values
Answer: (A) Objects to objects
Q#7: Terms in FOL include:
(A) Constants, variables, and functions
(B) Predicates only
(C) BFS nodes
(D) Random assignments
Answer: (A) Constants, variables, and functions
Q#8: Atomic sentences in FOL are:
(A) Predicates applied to terms
(B) Functions only
(C) BFS nodes
(D) Random values
Answer: (A) Predicates applied to terms
Q#9: Literals in FOL can be:
(A) Positive or negated atomic sentences
(B) Functions only
(C) BFS nodes
(D) Random values
Answer: (A) Positive or negated atomic sentences
Q#10: Connectives in FOL include:
(A) ∧, ∨, ¬, ⇒, ⇔
(B) +, -, *, /
(C) BFS nodes
(D) DFS only
Answer: (A) ∧, ∨, ¬, ⇒, ⇔
Q#11: Quantifiers in FOL are:
(A) Universal ∀ and Existential ∃
(B) BFS only
(C) DFS only
(D) Random values
Answer: (A) Universal ∀ and Existential ∃
Q#12: ∀x P(x) means:
(A) P(x) is true for all x
(B) P(x) is true for some x
(C) Random assignment
(D) BFS only
Answer: (A) P(x) is true for all x
Q#13: ∃x P(x) means:
(A) P(x) is true for at least one x
(B) P(x) is true for all x
(C) Random assignment
(D) DFS only
Answer: (A) P(x) is true for at least one x
Q#14: Negation in FOL applies to:
(A) Entire sentences or literals
(B) Variables only
(C) Functions only
(D) BFS nodes
Answer: (A) Entire sentences or literals
Q#15: FOL knowledge base contains:
(A) Facts and rules
(B) Random values
(C) BFS nodes
(D) DFS only
Answer: (A) Facts and rules
Q#16: Inference in FOL is:
(A) Deriving new sentences from existing knowledge
(B) Random assignment
(C) BFS only
(D) DFS only
Answer: (A) Deriving new sentences from existing knowledge
Q#17: Modus ponens is used to:
(A) Infer conclusions from implications
(B) Random moves
(C) BFS expansion
(D) DFS depth
Answer: (A) Infer conclusions from implications
Q#18: Universal instantiation allows:
(A) Replacing ∀x with a specific constant
(B) Random assignment
(C) BFS nodes
(D) DFS only
Answer: (A) Replacing ∀x with a specific constant
Q#19: Existential instantiation allows:
(A) Replacing ∃x with a new constant
(B) BFS nodes
(C) DFS only
(D) Random assignment
Answer: (A) Replacing ∃x with a new constant
Q#20: Conjunctive normal form (CNF) is:
(A) Conjunction of disjunctions of literals
(B) Disjunction of conjunctions
(C) BFS nodes
(D) DFS only
Answer: (A) Conjunction of disjunctions of literals
Q#21: Resolution in FOL is:
(A) Single inference rule for refutation
(B) Random assignment
(C) BFS only
(D) DFS only
Answer: (A) Single inference rule for refutation
Q#22: FOL can represent:
(A) Objects, relations, and functions
(B) Random values only
(C) BFS nodes only
(D) DFS only
Answer: (A) Objects, relations, and functions
Q#23: FOL allows reasoning about:
(A) Individuals and their properties
(B) Random assignments
(C) BFS nodes
(D) DFS only
Answer: (A) Individuals and their properties
Q#24: Skolemization removes:
(A) Existential quantifiers by introducing constants/functions
(B) Universal quantifiers
(C) BFS nodes
(D) DFS depth
Answer: (A) Existential quantifiers by introducing constants/functions
Q#25: Standardizing apart prevents:
(A) Variable name clashes
(B) BFS expansion
(C) DFS only
(D) Random assignment
Answer: (A) Variable name clashes
Q#26: Unification in FOL finds:
(A) Substitutions to make two terms/sentences identical
(B) BFS nodes
(C) DFS depth
(D) Random assignment
Answer: (A) Substitutions to make two terms/sentences identical
Q#27: Substitution maps:
(A) Variables to terms
(B) Constants to predicates
(C) BFS nodes
(D) DFS only
Answer: (A) Variables to terms
Q#28: FOL inference can be:
(A) Forward chaining or backward chaining
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Forward chaining or backward chaining
Q#29: Forward chaining starts from:
(A) Known facts
(B) Goal
(C) BFS nodes
(D) DFS only
Answer: (A) Known facts
Q#30: Backward chaining starts from:
(A) Goal
(B) Known facts
(C) BFS only
(D) DFS only
Answer: (A) Goal
Q#31: FOL can express:
(A) Complex statements about relationships
(B) Random values only
(C) BFS nodes
(D) DFS depth
Answer: (A) Complex statements about relationships
Q#32: Horn clauses have:
(A) At most one positive literal
(B) No positive literal
(C) BFS nodes
(D) DFS only
Answer: (A) At most one positive literal
Q#33: FOL is more expressive than propositional logic because:
(A) It includes quantifiers, variables, and functions
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) It includes quantifiers, variables, and functions
Q#34: Knowledge base consistency ensures:
(A) No contradictions
(B) Random assignments
(C) BFS only
(D) DFS only
Answer: (A) No contradictions
Q#35: Refutation in FOL proves:
(A) Sentence is entailed by knowledge base
(B) Random assignment
(C) BFS only
(D) DFS only
Answer: (A) Sentence is entailed by knowledge base
Q#36: FOL reasoning can be:
(A) Sound and complete
(B) Random only
(C) BFS only
(D) DFS only
Answer: (A) Sound and complete
Q#37: Predicate symbols in FOL denote:
(A) Relations or properties
(B) Objects
(C) Variables only
(D) BFS nodes
Answer: (A) Relations or properties
Q#38: Function symbols in FOL denote:
(A) Mappings from objects to objects
(B) Random assignments
(C) BFS only
(D) DFS only
Answer: (A) Mappings from objects to objects
Q#39: Constants in FOL are:
(A) Specific objects in the domain
(B) Variables
(C) BFS nodes
(D) DFS only
Answer: (A) Specific objects in the domain
Q#40: Equality in FOL allows:
(A) Expressing that two terms refer to the same object
(B) Random assignment
(C) BFS only
(D) DFS only
Answer: (A) Expressing that two terms refer to the same object
Q#41: Inference in FOL is computationally:
(A) Semi-decidable
(B) Fully decidable
(C) BFS only
(D) DFS only
Answer: (A) Semi-decidable
Q#42: Knowledge base in FOL contains:
(A) Set of sentences
(B) Random values
(C) BFS nodes
(D) DFS only
Answer: (A) Set of sentences
Q#43: Resolution refutation works by:
(A) Negating the goal and deriving a contradiction
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Negating the goal and deriving a contradiction
Q#44: FOL can encode:
(A) Facts, rules, and queries
(B) BFS only
(C) DFS only
(D) Random values
Answer: (A) Facts, rules, and queries
Q#45: Standardizing apart is necessary before:
(A) Combining multiple clauses
(B) BFS expansion
(C) DFS depth
(D) Random assignment
Answer: (A) Combining multiple clauses
Q#46: Skolem functions replace:
(A) Existentially quantified variables
(B) Universal quantifiers
(C) BFS nodes
(D) DFS only
Answer: (A) Existentially quantified variables
Q#47: Unification fails if:
(A) Terms cannot be made identical
(B) BFS node exists
(C) DFS depth exceeded
(D) Random assignment fails
Answer: (A) Terms cannot be made identical
Q#48: FOL is widely used in:
(A) Expert systems, planning, NLP
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Expert systems, planning, NLP
Q#49: Knowledge representation in FOL helps AI to:
(A) Reason about objects and relations
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Reason about objects and relations
Q#50: Main advantage of FOL over propositional logic is:
(A) Higher expressiveness
(B) BFS nodes
(C) DFS depth
(D) Random assignments
Answer: (A) Higher expressiveness