Towards a Theory of Elaboration Tolerance: Logic Programming Approach (1995)
| Venue: | Int'l Journal of Software Engineering and Knowledge Engineering |
| Citations: | 11 - 4 self |
BibTeX
@ARTICLE{Gelfond95towardsa,
author = {Michael Gelfond and Halina Przymusinska},
title = {Towards a Theory of Elaboration Tolerance: Logic Programming Approach},
journal = {Int'l Journal of Software Engineering and Knowledge Engineering},
year = {1995},
volume = {6},
pages = {6--1}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper is an attempt at mathematical investigation of software development process in the context of declarative logic programming. We introduce notions of specification and specification constructor which are developed from natural language description of a problem. Generalizations of logic programs, called lp-functions are introduced to represent these specifications. We argue that the process of constructing lp-function representing a specification S should be supported by certain types of mathematical results which we call representation theorems. We present two such theorems to illustrate the idea. 1 Introduction This paper is written in the framework of declarative logic programming paradigm (see, for instance, [17, 14]) which strives to reduce a substantial part of a programming process to the description of objects comprising the domain of interest and relations between these objects. After such description is produced by a programmer it can be queried to establish truth o...
