The Semantically Guided Linear Deduction System
نویسنده
چکیده
GLD's eight deduction operations consist of six inference operations extension, unit subsumed extension, A-reduction, identical A-reduction, C-reduction, and identical C-reduction; and two bookkeeping operations A-truncation and C-truncation. The extension operations are, in combination, equivalent to the extension operations of other chain format systems. GLD's reduction operations combine features from Model Elimination (ME) [Loveland, 1969] and the GC procedure. A significant feature of GLD's non-compulsory reduction operations is the use of a selection rule, which provides a search guidance point not available in most other chain format systems. The reduction operations work in tandem with A-truncation to implement re-use of deduced information.
منابع مشابه
A Linear Deduction System with Integrated Semantic Guidance
Guidance systems are central to the success of automated deduction systems. Semantic guidance systems are guidance systems that exploit semantic information when guiding the search of a deduction system. The general objective of this research has been to investigate how semantic guidance can be used to improve the performance of automated deduction systems. More specifically, this research has ...
متن کاملDesigning Examples for Semantically Guided Hierarchical Deduction
Semantically guided hierarchical deduction prover is a resolution-based theorem-proving procedure which is capable of using the domain dependent knowledge presented in well designed examples. This paper gives an overview of the basic deduction components of the prover, investigates some rules for human design of examples, and demonstrates their usage in proving several non-trivial theorems.
متن کاملGuiding Linear Deductions with Semantics
Guidance is a central issue in Automatic Theorem Proving systems due to the enormity of the search space that these systems navigate. Semantic guidance uses semantic information to direct the path an ATP system takes through the search space. The use of semantic information is potentially more powerful than syntactic information for guidance. This research aimed to discover a method for incorpo...
متن کاملFrom Classical Extensional Higher-Order Tableau to Intuitionistic Intentional Natural Deduction
We define a translation that maps higher-order formulas provable in a classical extensional setting to semantically equivalent formulas provable in an intuitionistic intensional setting. For the classical extensional higher-order proof system we define a Henkincomplete tableau calculus. For the intuitionistic intensional higher-order proof system we give a natural deduction calculus. We prove t...
متن کاملThe Deduction Rule and Linear and Near-Linear Proof Simulations
We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in Frege proof systems compared to lengths in these new systems. As applications we give near-linear simulations of the propositio...
متن کامل