System predicates for control of logical inference in automated theorem proving systems based on calculi of positively constructed formulae

Бесплатный доступ

An approach for a control process implementation of search for automated theorem proof in the calculi of positively constructed formulae is described in the paper. The search process is represented as system predicates and their combinations in the original logical language for formulae definition. Application recommendations of the approach are proposed.

Calculi of positively constructed formulae, automated theorem proving, logical inference

Короткий адрес: https://sciup.org/148180546

IDR: 148180546

Статья научная