Advertisement

OORA: Ontology Oriented Requirement Analysis

  • Ruqian Lu
  • Zhi Jin
Chapter
Part of the The Springer International Series on Asian Studies in Computer and Information Science book series (ASIS, volume 8)

Abstract

People tend to divide the programming languages in two classes: the procedural languages and the declarative languages. While the former specifies how the programmer should do step by step, the latter tells only what result the program should produce. How and what, these two keywords are essential for the differences between the above two classes. No one would argue that the procedural languages could be executed by the computer. But the converse is not true. That means, not every executable language is a procedural one. Many declarative languages can also be executed by the computer. In this way, they serve as good candidates for being used to write software and program specifications. Such languages have got a nice name: the executable specification languages. They are especially suited for programming software prototypes.

Keywords

Leaf Node Main Relation Father Node Shop Model Commonsense Knowledge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Ruqian Lu
    • 1
  • Zhi Jin
    • 1
  1. 1.Academia SinicaBeijingPeople’s Republic of China

Personalised recommendations