Reasoning, Metareasoning, and Mathematical Truth: Studies of Theorem Proving under Limited Resources
نویسندگان
چکیده
In earlier work, we introduced flexible infer ence and decision-theoretic metareasoning to address the intractability of normative infer ence. Here, rather than pursuing the task of computing beliefs and actions with decision models composed of distinctions about uncer tain events, we examine methods for inferring beliefs about mathematical truth before an automated theorem prover completes a proof. We employ a Bayesian analysis to update be lief in truth, given theorem-proving progress, and show how decision-theoretic methods can be used to determine the value of continuing to deliberate versus taking immediate action in time-critical situations.
منابع مشابه
Reasoning, Metareasoning, and Mathematical Truth: Studies of Theorem Proving under Limited Resources 3
In earlier work, we introduced exible inference and decision-theoretic metareasoning to address the intractability of normative inference. Here, rather than pursuing the task of computing beliefs and actions with decision models composed of distinctions about uncertain events, we examine methods for inferring beliefs about mathematical truth before an automated theorem prover completes a proof....
متن کاملIdeal Partition of Resources for Metareasoning∗
We can achieve significant gains in the value of computation by metareasoning about the nature or extent of base-level problem solving before executing a solution. However, resources that are irrevocably committed to metareasoning are not available for executing a solution. Thus, it is important to determine the portion of resources we wish to apply to metareasoning and control versus to the ex...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملMatrix-Based Inductive Theorem Proving
R.Dyckhoff, ed., International Conference TABLEAUX-2000, LNAI 1847, pp. 294–309, c ©Springer Verlag, 2000. Abstract. We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a matrix proof is guided by the symmetries between induction hypothesis and induction conclusion while ...
متن کاملLearning to select computations
Efficient use of limited computational resources is essential to intelligence. Selecting computations optimally according to rational metareasoning would achieve this, but rational metareasoning is computationally intractable. Inspired by psychology and neuroscience, we propose the first learning algorithm for approximating the optimal selection of computations. We derive a general, sample-effi...
متن کامل