Inference and Resolution Questions and Answers

Q: Assertion (A): A resolution prover negates the goal before beginning its search. Reason (R): Resolution is refutation complete rather than directly complete. Select the correct answer from the options below.

Both are true and the second is the reason. Since the rule guarantees only that an unsatisfiable set will yield the empty clause, the entailment question must first be converted into an unsatisfiability question by negating what is to be proved. The refutation identity makes that conversion sound. A proof strategy dictated by the precise form of the completeness result available is a good illustration of theory determining practice.

Q: What is inference in a logical system?

Inference produces conclusions that follow from what is already believed, which is what distinguishes a knowledge base from a store of records. Syntax checking, storage and translation are supporting operations. Keeping the derivation of new content separate from the management of existing content is what allows a general reasoner to be written once and applied to any domain, which is the architectural promise of the whole approach.

Q: What is a proof?

A proof is a syntactic object whose steps can be checked mechanically, which is why a machine derived proof can be verified independently of the machine that found it. Truth in an interpretation is semantic, persuasion is informal, and the search record is usually far larger than the proof. That finding a proof is hard and checking one is easy is the asymmetry the whole enterprise rests on.

Q: Why is checking a proof easier than finding one?

Verification examines each step in turn and confirms it instantiates an inference rule, which is linear in the proof's length, while finding the proof required searching an enormous space. Proof length varies, domain knowledge is not needed by either, and assuming correctness would defeat the purpose. An asymmetry between constructing and verifying is what allows a complex tool to be trusted through a simple one.

Q: What is a proof checker?

Because the checker is small it can itself be scrutinised, so trust in a large prover reduces to trust in a few hundred lines. That arrangement is called the de Bruijn criterion. Searching, translating and rule selection belong to the prover rather than the checker. Concentrating the trust in the smallest possible component is a security and assurance principle that applies well beyond theorem proving.

Q: What is an interactive theorem prover?

In an interactive system the human supplies the structure and the difficult steps while the machine handles the routine ones and guarantees correctness. Large mathematical results and operating system kernels have been verified this way. Progress reporting, interruption and question asking are interface features. Dividing labour between a human's judgement and a machine's rigour, rather than seeking full automation, is what made large verifications achievable.

Q: What is a tactic in an interactive prover?

Tactics let a user apply a whole family of routine steps with one command, and tactics may be composed into larger ones, which is what makes large proofs manageable. The user builds a vocabulary suited to the domain being formalised. Conjecture selection, search heuristics and history are different notions. Providing a language in which the user can extend the tool's repertoire is what allows a general system to become specialised without being rewritten.

Q: What is the difference between a prover and a solver?

The two answer different questions, though refutation connects them, since proving a theorem amounts to showing a formula unsatisfiable. Both exist for both logics, both may be automatic, and satisfiability solvers are complete. Recognising that two tools answer questions that a single identity converts into one another is what allows a problem to be handed to whichever has the better implementation.

Q: Why are propositional solvers used for problems stated in richer logics?

Decades of engineering have made satisfiability solvers extraordinarily fast, so bounding a problem and encoding it propositionally often beats reasoning in the natural formalism. The cost is the loss of generality that bounding entails. Sound procedures exist for richer logics, constraints must still be encoded, and expressiveness runs the other way. Choosing the formalism with the best tools, rather than the most natural one, is a pragmatic move worth considering explicitly.

Q: What is bounded model checking?

Unrolling a system's transitions to a fixed depth and asking a satisfiability solver whether a violation occurs within them finds shallow bugs very effectively. Absence of a counterexample within the bound proves nothing beyond it unless a completeness threshold is established. Model size, memory and single steps are different restrictions. A method that finds errors reliably without proving their absence is valuable precisely because errors are what most projects have.

51.

Assertion (A): A resolution prover negates the goal before beginning its search.

Reason (R): Resolution is refutation complete rather than directly complete.

Select the correct answer from the options below.

A.A is true but R is false
B.A is false but R is true
C.Both A and R are true, and R is the correct explanation of A
D.Both A and R are true, but R is not the correct explanation of A

Answer: C

Both are true and the second is the reason. Since the rule guarantees only that an unsatisfiable set will yield the empty clause, the entailment question must first be converted into an unsatisfiability question by negating what is to be proved. The refutation identity makes that conversion sound. A proof strategy dictated by the precise form of the completeness result available is a good illustration of theory determining practice.

Discuss in Forum

52.

What is inference in a logical system?

A.Checking whether a sentence has been written correctly according to the syntax
B.Storing sentences so that they may be retrieved efficiently later on
C.Translating sentences from one representation into another equivalent one
D.Deriving new sentences from those already accepted

Answer: D

Inference produces conclusions that follow from what is already believed, which is what distinguishes a knowledge base from a store of records. Syntax checking, storage and translation are supporting operations. Keeping the derivation of new content separate from the management of existing content is what allows a general reasoner to be written once and applied to any domain, which is the architectural promise of the whole approach.

Discuss in Forum

53.

What is a proof?

A.A finite sequence of sentences each justified by a rule
B.A demonstration that a sentence is true in the intended interpretation of the domain
C.An argument persuading a reader that a conclusion follows from the premises
D.A record of the search a prover performed before finding the conclusion

Answer: A

A proof is a syntactic object whose steps can be checked mechanically, which is why a machine derived proof can be verified independently of the machine that found it. Truth in an interpretation is semantic, persuasion is informal, and the search record is usually far larger than the proof. That finding a proof is hard and checking one is easy is the asymmetry the whole enterprise rests on.

Discuss in Forum

54.

Why is checking a proof easier than finding one?

A.The checker may assume the prover has already done the work correctly
B.Each step need only be matched against a rule
C.Proofs are always much shorter than the searches that produced them
D.Checking requires no knowledge of the domain the proof concerns

Answer: B

Verification examines each step in turn and confirms it instantiates an inference rule, which is linear in the proof's length, while finding the proof required searching an enormous space. Proof length varies, domain knowledge is not needed by either, and assuming correctness would defeat the purpose. An asymmetry between constructing and verifying is what allows a complex tool to be trusted through a simple one.

Discuss in Forum

55.

What is a proof checker?

A.A system that translates informal arguments into formal derivations
B.A component that decides which inference rule should be applied next
C.A small program verifying each step of a derivation
D.A tool that searches for proofs of conjectures supplied by a user

Answer: C

Because the checker is small it can itself be scrutinised, so trust in a large prover reduces to trust in a few hundred lines. That arrangement is called the de Bruijn criterion. Searching, translating and rule selection belong to the prover rather than the checker. Concentrating the trust in the smallest possible component is a security and assurance principle that applies well beyond theorem proving.

Discuss in Forum

56.

What is an interactive theorem prover?

A.A prover that reports its progress to the user while it is searching
B.A prover that may be interrupted and resumed at any convenient point
C.A system that proves theorems by asking the user many questions about them
D.A system in which a person directs the proof and the machine checks it

Answer: D

In an interactive system the human supplies the structure and the difficult steps while the machine handles the routine ones and guarantees correctness. Large mathematical results and operating system kernels have been verified this way. Progress reporting, interruption and question asking are interface features. Dividing labour between a human's judgement and a machine's rigour, rather than seeking full automation, is what made large verifications achievable.

Discuss in Forum

57.

What is a tactic in an interactive prover?

A.A procedure transforming a goal into simpler subgoals
B.A strategy for deciding which conjecture to attempt next
C.A heuristic guiding the automated search within the prover
D.A record of the steps a user has already taken in a proof

Answer: A

Tactics let a user apply a whole family of routine steps with one command, and tactics may be composed into larger ones, which is what makes large proofs manageable. The user builds a vocabulary suited to the domain being formalised. Conjecture selection, search heuristics and history are different notions. Providing a language in which the user can extend the tool's repertoire is what allows a general system to become specialised without being rewritten.

Discuss in Forum

58.

What is the difference between a prover and a solver?

A.A prover is complete whereas a solver may return an approximate answer
B.A prover establishes entailment; a solver finds a satisfying assignment
C.A prover works on first order logic and a solver on propositional logic only
D.A prover is interactive whereas a solver operates entirely automatically

Answer: B

The two answer different questions, though refutation connects them, since proving a theorem amounts to showing a formula unsatisfiable. Both exist for both logics, both may be automatic, and satisfiability solvers are complete. Recognising that two tools answer questions that a single identity converts into one another is what allows a problem to be handed to whichever has the better implementation.

Discuss in Forum

59.

Why are propositional solvers used for problems stated in richer logics?

A.The encoding removes the need to state the problem's constraints
B.Propositional solvers can answer questions the richer logic cannot express
C.The encoded problem can be solved far faster than reasoning directly
D.Richer logics have no sound inference procedures available at all

Answer: C

Decades of engineering have made satisfiability solvers extraordinarily fast, so bounding a problem and encoding it propositionally often beats reasoning in the natural formalism. The cost is the loss of generality that bounding entails. Sound procedures exist for richer logics, constraints must still be encoded, and expressiveness runs the other way. Choosing the formalism with the best tools, rather than the most natural one, is a pragmatic move worth considering explicitly.

Discuss in Forum

60.

What is bounded model checking?

A.Checking a model whose size has been bounded in advance by the user
B.Verifying a property using only a bounded amount of memory
C.Restricting the model to the states reachable in one transition
D.Searching for a counterexample within a fixed number of steps

Answer: D

Unrolling a system's transitions to a fixed depth and asking a satisfiability solver whether a violation occurs within them finds shallow bugs very effectively. Absence of a counterexample within the bound proves nothing beyond it unless a completeness threshold is established. Model size, memory and single steps are different restrictions. A method that finds errors reliably without proving their absence is valuable precisely because errors are what most projects have.

Discuss in Forum

Loading…

Topics

Other Subjects

Tags: Inference and Resolution Questions and Answers || Inference and Resolution MCQ Questions and Answers || Inference and Resolution GK Questions and Answers || Inference and Resolution GK MCQ Questions || Inference and Resolution Multiple Choice Questions and Answers || Inference and Resolution GK || GK on Inference and Resolution || Artificial Intelligence Questions and Answers || Artificial Intelligence MCQ Questions and Answers || Artificial Intelligence GK Questions and Answers || GK on Artificial Intelligence

Inference and Resolution Questions and Answers

Topics

Other Subjects

About Us

Stay informed about all important Dates & Notifications