Machine methods for proving logical arguments expressed in englis

This paper describes a COMIT program that proves the validity of logical arguments expressed in a restricted form of ordinary English. Some special features include its ability to translate an input argument into logical notation in four progressively refined ways, of which the first pertains to propositional logic and the last three to first-order functional logic; and its ability in many cases to select the "correct" logical translation of an argument, i.e., the translation that yields the simplest proof....

27p nghetay_1 06-04-2013 43 3   Download