Staff View
Representations and modeling in problems of program formation

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
1 online resource (96 pages) : illustrations
Note (type = special display note)
Technical report DCS-TR-5
Name (authority = RutgersOrg-School); (type = corporate)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (authority = RutgersOrg-Department); (type = corporate)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Representations and modeling in problems of program formation
Abstract (type = abstract)
We are considering a class of problems of formation type where the goal is to construct by computer a program-in a given programming language - that satisfies an infinite number of conditions in -the form of given input-output correspondences. A variety of automatic design problems, as well as problems of theory construction in empirical sciences are of this general type. The main problem in the design of procedures for the solution of formation problems are: selection of an "appropriate" grammar for specifying -the language in which candidate solutions are to be represented; formulation of evaluation procedures for ordering candidate solutions; and formulating of control strategies for generating "intelligently" a sequence of candidate solutions which converges efficiently to the desired solution. The problems of representation, evaluation and control are closely coupled; However, dominant among them is the problem of representation. A promising approach to the choice of a grammar for the solution language is to find a model corresponding to the grammar where it is relatively easy to evaluate the relative merit of candidate solutions (in terms of their satisfying the given problem conditions) by analyzing their representations in the model. In our program formation problem we have found such a model in the form of a mathematical system which is a modified algebra of relations. The atomic elements of the system correspond to elementary commands in the given programming language and its operations correspond to program composites. The rich structure of relationships in the mathematical model provides a framework for reasoning about the choice of candidate solutions during, the problem solving process. In view of our work to date, it appears that representation systems with considerable algebraic structure are necessary for computer formation procedures of reasonable power.
Name (type = personal)
NamePart (type = family)
Amarel
NamePart (type = given)
Saul
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
1970-07
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/t3-qsd8-ym35
Genre (authority = ExL-Esploro)
Technical Documentation
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2020