Abstract

In this paper a system termed the Maryland refutation proof procedure system (MRPPS) is described. MRPPS is an interactive system which gives the user the ability to create and maintain a core-bound data base and to input queries either as well-formed formulas in the first-order predicate calculus or as clauses. MRPPS consists of three basic components: (1) a set of inference rules for making logical deductions, many of which are based on the resolution principle; (2) a search strategy for heuristically determining the sequence in which to select base clauses and to perform deductions on clauses already generated; and (3) a base clause selection strategy that uses heuristic and semantic information for determining which data axioms and general axioms are to be brought to bear on the problem. These three components are described and MRPPS is compared to related work.

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 call

Disclaimer: 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.