Towards Full Automation of Deduction: A Case Study
نویسنده
چکیده
We present rst steps towards fully automated deduction that merely requires the user to submit proof problems and pick up results. Essentially, this necessitates the automation of the crucial step in the use of a deduction system, namely choosing and connguring an appropriate search-guiding heuristic. Furthermore, we motivate why learning capabilities are pivotal for satisfactory performance. The infrastructure for automating both the selection of a heuristic and integration of learning are provided in form of an environment embedding the \core" deduction system. We have conducted a case study in connection with a deduction system based on condensed detachment. Our experiments with a fully automated deduction system`AutoCoDe' have produced remarkable results. We substantiate Au-toCoDe's encouraging achievements with a comparison with the renowned theorem prover Otter. AutoCoDe outperforms Otter even when assuming very favorable conditions for Otter.
منابع مشابه
Bi-rewriting rewriting logic
Rewriting logic appears to have good properties as logical framework, and can be useful for the development of programming languages which attempt to integrate various paradigms of declarative programming. In this paper I propose to tend towards the operational semantics for such languages by basing it on bi-rewrite systems and ordered chaining calculi which apply rewrite techniques to rst-orde...
متن کاملAn Innovative System for Full-Management of CB Using Current Injection Method
In this article, an innovative supervision system will be proposed that can observe and analyze health of Circuit Breaker’s trip coil. The proposed design also logs changes in the coil's quality and informs network supervisor in case of Circuit Breaker (CB) failure. This system injects small direct currents to the Circuit Breaker connections and the trip coil to compute CB’s health and characte...
متن کاملAutomated Reasoning in Kleene Algebra
It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. We demonstrate that off-the-shelf automated proof and counterexample search is an interesting alternative if combined with the right domain model. We implement variants of Kleene algebras axiomatically in Prover9/Mace4 and perform proof exp...
متن کاملA Survey of Automated Deduction
We survey research in the automation of deductive inference, from its beginnings in the early history of computing to the present day. We identify and describe the major areas of research interest and their applications. The area is characterised by its wide variety of proof methods, forms of automated deduction and applications.
متن کاملA Case Study in Automated, Modular, and Full Functional Verification
Mechanical and full verification of behavior of object-based programs is a central software engineering problem. Any successful solution to the problem should strike a delicate compromise between amenability to automation and several software engineering factors, such as the form and ease of specifications, demands on software developers to provide invariants and hints, development and use of r...
متن کامل