Results 1  10
of
19
Bootstrapping Lexical Choice via MultipleSequence Alignment
 IN PROCEEDINGS OF THE 2002 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP
, 2002
"... An important component of any generation system is the mapping dictionary, a lexicon of elementary semantic expressions and corresponding natural language realizations. Typically, ..."
Abstract

Cited by 52 (4 self)
 Add to MetaCart
(Show Context)
An important component of any generation system is the mapping dictionary, a lexicon of elementary semantic expressions and corresponding natural language realizations. Typically,
LΩUI: Lovely ΩMEGA User Interface
, 2001
"... The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the
PLATΩ: A mediator between texteditors and proof assistance systems
, 2007
"... We present a generic mediator, called PlatΩ, between texteditors and proof assistants. PlatΩ aims at integrated support for the development, publication, formalization, and verification of mathematical documents in a natural way as possible: The user authors his mathematical documents with a scient ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We present a generic mediator, called PlatΩ, between texteditors and proof assistants. PlatΩ aims at integrated support for the development, publication, formalization, and verification of mathematical documents in a natural way as possible: The user authors his mathematical documents with a scientific WYSIWYG texteditor in the informal language he is used to, that is a mixture of natural language and formulas. These documents are then semantically annotated preserving the textual structure by using the flexible, parameterized proof language which we present. From this informal semantic representation PlatΩ automatically generates the corresponding formal representation for a proof assistant, in our case Ωmega. The primary task of PlatΩ is the maintenance of consistent formal and informal representations during the interactive development of the document.
A generic software safety document generator
 In Proc. 10th AMAST
, 2004
"... Abstract. Formal certification is based on the idea that a mathematical proof of some property of a piece of software can be regarded as a certificate of correctness which, in principle, can be subjected to external scrutiny. In practice, however, proofs themselves are unlikely to be of much interes ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Formal certification is based on the idea that a mathematical proof of some property of a piece of software can be regarded as a certificate of correctness which, in principle, can be subjected to external scrutiny. In practice, however, proofs themselves are unlikely to be of much interest to engineers. Nevertheless, it is possible to use the information obtained from a mathematical analysis of software to produce a detailed textual justification of correctness. In this paper, we describe an approach to generating textual explanations from automatically generated proofs of program safety, where the proofs are of compliance with an explicit safety policy that can be varied. Key to this is tracing proof obligations back to the program, and we describe a tool which implements this to certify code autogenerated by AutoBayes and AutoFilter, program synthesis systems under development at the NASA Ames Research Center. Our approach is a step towards combining formal certification with traditional certification methods. 1
Clause Aggregation: An Approach to Generating Concise Text
 COLUMBIA UNIVERSITY
, 2002
"... This dissertation identifies and resolves constraints related to the task of combining related clauses to formulate fluent and concise sentences. To incorporate complex linguistic constructions into text generation systems, novel algorithms were designed to systematically generate conjunction, ellip ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
This dissertation identifies and resolves constraints related to the task of combining related clauses to formulate fluent and concise sentences. To incorporate complex linguistic constructions into text generation systems, novel algorithms were designed to systematically generate conjunction, ellipsis, and quantification constructions. Casper a submodule in a text generation system, was designed and implemented. It can convey the same information using fewer words by taking advantage of redundancies in the input based on syntactic, semantic, and discourse information. In addition to these symbol approaches, my research also employs corpusbased statistical approaches to enhance the fluency of the generated text. By employing advance linguistic constructions and removing redundancies through clause aggregations, the generated text or speech is more fluent and concise and thus improves humancomputer interface.
Planning Proof Content for Communicating Induction
"... We describe some of the complications involved in expressing the technique of induction when automatically generating textual versions of formal mathematical proofs produced by a theorem proving system, and describe our approach to this problem. The pervasiveness of induction within mathematical pro ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We describe some of the complications involved in expressing the technique of induction when automatically generating textual versions of formal mathematical proofs produced by a theorem proving system, and describe our approach to this problem. The pervasiveness of induction within mathematical proofs makes its effective generation vital to readable proof texts. Our focus is on planning texts involving induction. Our efforts are driven by a corpus of humanproduced proof texts, incorporating both regularities within this corpus and the formal structure of induction into coherent text plans.
User interface features in Theorema: A summary
 In Mathematical UserInterfaces Workshop
, 2004
"... Abstract. This paper presents the main features of Theorema’s user interface. We briefly describe how mathematical knowledge can be expressed in the Theorema Formal Text Language and how the knowledge can be used for proving, solving, computing. We illustrate how the system presents the proofs it ge ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents the main features of Theorema’s user interface. We briefly describe how mathematical knowledge can be expressed in the Theorema Formal Text Language and how the knowledge can be used for proving, solving, computing. We illustrate how the system presents the proofs it generated and how the user can influence the proof search process interactively. 1
System Description: A Dialogue Manager Supporting Natural Language Tutorial Dialogue on Proofs
 UITP 2005 PRELIMINARY VERSION
, 2005
"... The Dialog project investigates flexible natural language tutorial dialogue on mathematical proofs. Since the medium of communication is natural language dialogue, and since tutorial dialogues are by nature both flexible and unpredictable, it is essential to include a sophisticated, dedicated dialog ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
The Dialog project investigates flexible natural language tutorial dialogue on mathematical proofs. Since the medium of communication is natural language dialogue, and since tutorial dialogues are by nature both flexible and unpredictable, it is essential to include a sophisticated, dedicated dialogue manager to handle the interaction between student and the system modules. In this paper we present the design and implementation of the dialogue manager for the demonstrator system of the Dialog project. The dialogue manager forms the interface between the user and the system modules, including the automated theorem prover Ωmega–Core, the tutorial module and the linguistic analysis module.
A Dialogue Manager supporting Natural Language Tutorial Dialogue on Proofs
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 2006
"... The Dialog project investigates flexible natural language tutorial dialogue on mathematical proofs. Due to the flexible and unpredictable nature of tutorial dialogue in natural language it is essential to include a sophisticated, dedicated dialogue manager to handle the interaction between student a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The Dialog project investigates flexible natural language tutorial dialogue on mathematical proofs. Due to the flexible and unpredictable nature of tutorial dialogue in natural language it is essential to include a sophisticated, dedicated dialogue manager to handle the interaction between student and the system modules. In this paper we present the design and implementation of the dialogue manager for the demonstrator system of the Dialog project. The dialogue manager forms the interface between the user and the system modules, including the automated theorem prover Ωmega–Core, the tutorial module and the linguistic analysis module. We also give an evaluation of Rubin, the development platform for the dialogue manager.