Abstract:
The preprocessing of positively-constructed formulas (PCFs) for automatic deduction search algorithms is considered in this paper. A new efficient algorithm for conversio...Show MoreMetadata
Abstract:
The preprocessing of positively-constructed formulas (PCFs) for automatic deduction search algorithms is considered in this paper. A new efficient algorithm for conversion of the predicate calculus language formulas to the language of PCFs and equivalent rules of reducing PCFs, preserving the original heuristic structure of knowledge represented by the formulas of the predicate calculus language, are presented.
Published in: 2016 39th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)
Date of Conference: 30 May 2016 - 03 June 2016
Date Added to IEEE Xplore: 28 July 2016
ISBN Information: