Results 1  10
of
21
A Natural Language Approach For Requirements Engineering
, 1992
"... : The term Requirements Engineering refers to this part of a database development cycle that involves investigating the problems and requirements of the users community and developing a conceptual specification of the future system. Natural language plays an important role during this stage that has ..."
Abstract

Cited by 66 (1 self)
 Add to MetaCart
: The term Requirements Engineering refers to this part of a database development cycle that involves investigating the problems and requirements of the users community and developing a conceptual specification of the future system. Natural language plays an important role during this stage that has proved to be crucial in the development of computerized systems. The required acquisition of application domain knowledge is achieved either through documents and texts analysis or by means of interviews i.e through language manipulation. Similarly validation of the specification is made via oral discussions with users. The paper proposes that Requirements Engineering (R.E) should be supported by a CASE tool based on a linguistic approach. It presents a R.E support environment that generates the conceptual specification from a description of the problem space provided through natural language statements. Complementary, validation is based on texts generation from the conceptual specificatio...
Reconstructing Proofs at the Assertion Level
, 1994
"... Most automated theorem provers suffer from the problem that they can produce proofs only in formalisms difficult to understand even for experienced mathematicians. Effort has been made to reconstruct natural deduction (ND) proofs from such machine generated proofs. Although the single steps in ND pr ..."
Abstract

Cited by 63 (9 self)
 Add to MetaCart
Most automated theorem provers suffer from the problem that they can produce proofs only in formalisms difficult to understand even for experienced mathematicians. Effort has been made to reconstruct natural deduction (ND) proofs from such machine generated proofs. Although the single steps in ND proofs are easy to understand, the entire proof is usually at a low level of abstraction, containing too many tedious steps. To obtain proofs similar to those found in mathematical textbooks, we propose a new formalism, called ND style proofs at the assertion level , where derivations are mostly justified by the application of a definition or a theorem. After characterizing the structure of compound ND proof segments allowing assertion level justification, we show that the same derivations can be achieved by domainspecific inference rules as well. Furthermore, these rules can be represented compactly in a tre structure. Finally, we describe a system called PROVERB , which substantially sh...
Proof Verbalization as an Application of NLG
 PROCEEDINGS OF THE 15TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI
, 1997
"... This paper describes the linguistic part of a system called PROVERB, which transforms, abstracts, and verbalizes machinefound proofs into formated texts. Linguistically, the architecture of PROVERB follows most application oriented systems, and is a pipelined control of three components. Its ..."
Abstract

Cited by 44 (10 self)
 Add to MetaCart
This paper describes the linguistic part of a system called PROVERB, which transforms, abstracts, and verbalizes machinefound proofs into formated texts. Linguistically, the architecture of PROVERB follows most application oriented systems, and is a pipelined control of three components. Its macroplanner linearizes a proof and plans mediating communicative acts by employing a combination of hierarchical planning and focusguided navigation. The microplanner
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 44 (4 self)
 Add to MetaCart
An important component of any generation system is the mapping dictionary, a lexicon of elementary semantic expressions and corresponding natural language realizations. Typically,
Planning Argumentative Texts
, 1994
"... This paper presents PROVERB, a text planner for argumentative texts. PIOVERB's main fimtm'e is that it combines global hierarchical plannillg alld illlphmncd organization of text with respect to local derivation relations in a complementary way. The Ibmmr splits the task of presenting a particnlar p ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
This paper presents PROVERB, a text planner for argumentative texts. PIOVERB's main fimtm'e is that it combines global hierarchical plannillg alld illlphmncd organization of text with respect to local derivation relations in a complementary way. The Ibmmr splits the task of presenting a particnlar proof' subtasks of presenting suhproof. q'hc latter sinmlal.cs how the next intermediate conclnsion to be presented is chosen under the guidance of the local focus.
Verbalization of highlevel formal proofs
 In Proceedings of the Sixteenth National Conference on Artificial Intelligence
, 1999
"... We propose a new approach to text generation from formal proofs that exploits the highlevel and interactive features of a tacticstyle theorem prover. The design of our system is based on communication conventions identified in a corpus of texts. We show how to use dialogue with the theorem prover ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
We propose a new approach to text generation from formal proofs that exploits the highlevel and interactive features of a tacticstyle theorem prover. The design of our system is based on communication conventions identified in a corpus of texts. We show how to use dialogue with the theorem prover to obtain information that is required for communication but is not explicitly used in reasoning.
Presenting intuitive deductions via symmetric simplification
 In CADE10: Proceedings of the tenth international conference on Automated deduction
, 1990
"... In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today’s automated theorem proving systems, this requires a nontrivial translation procedure to extract humanoriented deductions from machineoriented pro ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today’s automated theorem proving systems, this requires a nontrivial translation procedure to extract humanoriented deductions from machineoriented proofs. Previously known translation procedures, though complete, tend to produce unintuitive deductions. One of the major flaws in such procedures is that too often the rule of indirect proof is used where the introduction of a lemma would result in a shorter and more intuitive proof. We present an algorithm, symmetric simplification, for discovering useful lemmas in deductions of theorems in first and higherorder logic. This algorithm, which has been implemented in the TPS system, has the feature that resulting deductions may no longer have the weak subformula property. It is currently limited, however, in that it only generates lemmas of the form C ∨ ¬C ′ , where C and C ′ have the same negation normal form. 1
Planning Reference Choices for Argumentative Texts
"... This paper deals with the reference choices involved in the generation of argumentative text. Since a natual segmentation of discourse into attentional spaces is needed to carry out this task, this paper first proposes an architecture for natural language generation that combines hierarchical planni ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
This paper deals with the reference choices involved in the generation of argumentative text. Since a natual segmentation of discourse into attentional spaces is needed to carry out this task, this paper first proposes an architecture for natural language generation that combines hierarchical planning and focusguided navigation, a work in its own right. While hierarchical planning spans out an attentional hierarchy of the discourse produced, local navigation fills details into the primitive discourse spaces. The usefulness of this architecture actually goes beyond the particular domain of application for which it is developed. A piece of argumentative text such as the proof of a mathematical theorem conveys a sequence of derivations. For each step of derivation, the premises derived in the previous context and the inference method (such as the application of a particular theorem or definition) must be made clear. Although not restricted to nominal phrases, our reference decisions are similar to those concerning nominal subsequent referring expressions. Based on the work of Reichmann, this paper presents a discourse theory that handles reference choices by taking into account both textual distance as well as the attentional hierarchy.