Abstract
One of the successful outcomes of the Fifth Generation Computer Systems Project is the development of Model Generation Theorem Provers (MGTPs). MGTPs have solved previously open problems in finite algebra, produced rapid proofs of condensed detachment problems, and are providing an inferential infrastructure for knowledge-processing research at ICOT. They successfully exploit the Fifth Generation Project's KLl logic programming language and parallel inference machines to achieve high performance and parallel speedup. This paper describes some of the key properties of MGTPs, reasons for their successes, and possible areas for future improvement.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
