Extending the Regular Restriction of Resolution to Non- Subdeductions
نویسندگان
چکیده
A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which detects whether reordering the resolutions in a given proof will generate an irregular proof. If so, the given proof is not minimal. A deduction system that keeps only minimal proofs retains completeness. We report on an initial implementation.
منابع مشابه
Extending the Regular Restriction of Resolution to Non-Linear Subdeductions
A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which detects whether reordering the resolutions in a given proof will generate an irregular proof. If so, the given proof is not minimal. A deduction system that keeps only minimal proofs retains completen...
متن کاملGeneralized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
متن کاملProjective maximal submodules of extending regular modules
We show that a projective maximal submodule of afinitely generated, regular, extending module is a directsummand. Hence, every finitely generated, regular, extendingmodule with projective maximal submodules is semisimple. As aconsequence, we observe that every regular, hereditary, extendingmodule is semisimple. This generalizes and simplifies a result of Dung and Smith. As another consequen...
متن کاملA Comparison of Mechanisms for Avoiding Repetition of Subdeductions in Chain Formal Linear Deduction Systems
One problem that chain format linear deduction systems can suffer from is the necessity of repeating subdeductions when unifiable literals appear in (possibly distinct) centre chains of a deduction. Four mechanisms for avoiding the repetition are : factoring, lemmas, C-literals, and caching. These mechanisms are examined, and it is concluded that lemmas and C-literals are the mechanisms of choi...
متن کاملExtending the Radar Dynamic Range using Adaptive Pulse Compression
The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999