15 research outputs found

    TPS: A Theorem-Proving System for Classical Type Theory

    No full text
    . This is description of TPS, a theorem-proving system for classical type theory (Church's typed #-calculus). TPS has been designed to be a general research tool for manipulating wffs of first- and higher-order logic, and searching for proofs of such wffs interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. Examples of theorems that TPS can prove completely automatically are given to illustrate certain aspects of TPS's behavior and problems of theorem proving in higher-order logic. AMS Subject Classification: 03-04, 68T15, 03B35, 03B15, 03B10. Key words: higher-order logic, type theory, mating, connection, expansion proof, natural deduction. 1. Introduction TPS is a theorem-proving system for classical type theory ## (Church's typed #-calculus [20]) which has been under development at Carnegie Mellon University for a number years. This paper gives a general..

    ETPS: A System to Help Students Write Formal Proofs

    No full text
    ETPS (Educational Theorem Proving System) is a program which logic students can use to write formal proofs in rst-order logic or higher-order logic. It enables students to concentrate on the essential logical problems involved in proving theorems, and automatically checks the proofs

    TPS: A Theorem Proving System for Classical Type Theory

    No full text
    This is a description of TPS, a theorem proving system for classical type theory (Church's typed l-calculus). TPS has been designed to be a general research tool for manipulating wffs of first- and higher-order logic, and searching for proofs of such wffs interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. Examples of theorems which TPS can prove completely automatically are given to illustrate certain aspects of TPS's behavior and problems of theorem proving in higher-order logic

    Speech understanding in open tasks

    No full text
    The Air Traffic Information Service task is currently used by DARPA as a common evaluation task for Spoken Language Systems. This task is an example of open type tasks. Subjects are given a task and allowed to interact spontaneously with the system by voice. There is no fixed lexicon or grammar, and subjects are likely to exceed those used by any given system. In order to evaluate system performance on such tasks, a common corpus of training data has been gathered and annotated. An independent test corpus was also created in a similar fashion. This paper explains the techniques used in our system and the performance results on the standard set of tests used to evaluate systems

    Indian guidelines on imaging of the small intestine in Crohn’s disease: A joint Indian Society of Gastroenterology and Indian Radiology and Imaging Association consensus statement

    No full text
    The Indian Society of Gastroenterology (ISG) Task Force on Inflammatory Bowel Disease and the Indian Radiological and Imaging Association (IRIA) developed combined ISG-IRIA evidence-based best-practice guidelines for imaging of the small intestine in patients suspected to have or having Crohn’s disease. The 29 consensus statements, developed through a modified Delphi process, are intended to serve as reference for teaching, clinical practice, and research
    corecore