Employing external reasoners in proof planning
نویسندگان
چکیده
This paper describes the integration of computer algebra systems and constraint solvers into proof planners. It shows how e cient external reasoners can be employed in proof planning and how the shortcuts of the external reasoners can be expanded to veri able natural deduction proofs in the proof planning framework. In particular, these shortcuts simplify and guide the formal proof. The paper illustrates the integration and cooperation of the external reasoners with an example from proof planning limit theorems.
منابع مشابه
Planning for workflow construction and maintenance on the Grid
We describe an implemented grid planner that has been used to compose workflows and schedule tasks on a computational Grid to solve scientific problems. We then discuss two issues that will demand further attention to make Grid and web service planners a reality. First, the planner must interact not only with external services that are to be composed in the final workflow, but also with externa...
متن کاملModel-Checking Memory Requirements of Resource-Bounded Reasoners
Memory bounds may limit the ability of a reasoner to make inferences and therefore affect the reasoner’s usefulness. In this paper, we propose a framework to automatically verify the reasoning capabilities of propositional memory-bounded reasoners which have a sequential architecture. Our framework explicitly accounts for the use of memory both to store facts and to support backtracking in the ...
متن کاملPlanning and Scheduling External Occulter Space Missions
This paper introduces the reader to a new class of space science missions employing a telescope and one or more mobile external occulters. Issues important for proper science and mission planning are discussed in light of the inherent mission constraints. Recommendations for software to analyze and optimize mission efficiency and construct integrated long-range plans are provided.
متن کاملProgress in Proof Planning : Planning Limit Theorems
Proof planning is an alternative methodology to classical automated theorem proving based on exhausitve search that was rst introduced by Bundy [8]. The goal of this paper is to extend the current realm of proof planning to cope with genuinely mathematical problems such as the well-known limit theorems rst investigated for automated theorem proving by Bledsoe. The report presents a general meth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 23 شماره
صفحات -
تاریخ انتشار 1999