Chen, Shuwei

He, Xingxing

Liu, J.

Xu, Yang

Zhong, Xiaomei

English

Resolution as a famous rule of inference has played a key role in automated reasoning for over five decades. A number of variants and refinements of resolution have been also studied, essentially, they are all based on binary resolution, that is, the cutting rule of the complementary pair while every deduction involves only two clauses. In the present work, we consider an extension of binary resolution rule, which is proposed as a novel contradiction separation based inference rule for automated deduction, targeted for dynamic and multiple (two or more) clauses handling in a synergized way, while binary resolution is its special case. This contradiction separation based dynamic multi-clause synergized automated deduction theory is then proved to be sound and complete. The development of this new extension is motivated not only by our view to show that such a new rule of inference can be generic, but also by our wish that this inference rule could provide a basis for more efficient automated deduction algorithms and systems

Ulster University's Research Portal

Contradiction separation based dynamic multi-clause synergized automated deduction

https://pure.ulster.ac.uk/ws/files/77319048/Information_Science_CS_2018_F_Accepted.pdf

Contradiction separation based dynamic multi-clause synergized automated deduction

Abstract

Similar works

Full text

Available Versions

Ulster University's Research Portal