Abstract
In simple terms problem solving is a process of reasoning that leads from facts known to facts desired but unknown. From the dawn of philosophy man has been, and still is, puzzled by his ability to perform this task and by his inability to describe how it is done.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Balzer, N. Greenfield, M. Kay, W. Mann, W. Ryder, D. Wilczynski, and A. Zobrist, Domain-independent automatic programming, Information Processing 74, 326–330, North-Holland (1974).
S. Y. Bang and R. T. Yeh, Toward a Theory of Relational Data Structure, Software Engineering and Systems Laboratory, University of Texas, Report SESLTR-2, 1974, Austin, Texas.
H. Bekic and K. Walk, Formalization of storage properties, Lecture Notes in Mathematics 188, 28–61, Springer Verlag (1971).
H. Biller and E. J. Neuhold, Formal view on schema-subschema correspondence, Information Processing 74, 367–371, North-Holland (1974).
R. Bosak, R. F. Clippinger, C. Dobbs, R. Goldfinger, R. B. Jasper, W. Keating, G. Kendrick, and J. E. Sammet, An information algebra, Comm. ACM 5, 190–204 (1962).
W. H. Burge, Combinatory programming and combinatorial analysis, IBM J. Res. and Dev. 1972 (September), 450–461.
D. L. Childs, Feasibility of a set-theoretical data structures—A general structure based on reconstituted definition of relation, in “Proc. IFIP 68,” Vol. I, pp. 420–430.
E. F. Codd, A relational model of data for large shared data banks, Comm. ACM 13, 377–387 (1970).
E. F. Codd, Recent investigations in relational data base systems, Information Processing 74, 1017–1021, North-Holland (1974).
M. E. D’Imperio, Data structures and their representation in storage, Annual Review of Automatic Programming 5, 1–75 (1968).
S. P. Ghosh and C. T. Abraham, Application of finite geometry in file organization for records with multiple-valued attributes, IBM J. Res. and Dev. 11, 180–187 (1968).
S. S. Gorokhovskii, Ju. V. Kapitonova, and A. A. Letichevskii, On programming and logical problem solving facilities in software (Basic concepts of L2 language) (in Russian), Kibernetika, No. 4, 1973, 27–47.
C. C. Gotlieb, Data Types and Structures. A Synthetic Approach, University of Toronto, Dept. of Computer Science, Techn. Report No. 61, February 1974.
M. Greniewski and W. M. Turski, The external language klipa for the ural-2 digital computer, Comm. ACM 6, 321–324 (1963).
C. A. R. Hoare, Proof of correctness of data representation, Acta Informatica 1, 271–281 (1972).
J. W. Klimbie and K. L. Koffeman (Eds.), “Data Base Management” (Proceedings of Working Conference), North-Holland (1974).
B. Langefors, Information systems, Information Processing 74, 937–945, North-Holland (1974).
V. Y. Lum, Multi-attribute retrieval with combined indexes, Comm. ACM 13, 660–665 (1970).
V. Y. Lum, General performance analysis of key-to-address transformation methods using an abstract file concept, Comm. ACM 16, 603–612 (1973).
G. H. Mealy, Another look at data, in “Proc. FJCC 1967,” pp. 525–534.
G. H. Mealy, Data structures: Theory and representation, Information Processing 74, 322–325, North-Holland (1974).
P. C. Patton, Data organization and access methods, Advances in Information Systems Science (J. T. Tou, ed.) 5, 1–95 (1974).
J. B. Rothnie and T. Lozano, Attribute based file organization in a paged memory environment, Comm. ACM 17, 63–69 (1974).
G. Salton, “Automatic Information Organization and Retrieval,” McGraw-Hill, New York (1968).
D. Teichroew, A survey of languages for stating requirement for computer-based information systems, in “Proc. FJCC 1972,” pp. 1203–4224.
W. M. Turski, Data structures and their ordering, IAG Journal 3, 141–150 (1970).
W. M. Turski, A model for data structures and its applications, Part I, Acta Informa-tica 1, 26–34 (1971);
W. M. Turski, A model for data structures and its applications, Part II, Acta Informa-tica 1, 282–289 (1972).
W. M. Turski, On a model of information retrieval system based on thesaurus, Inform. Stor. and Retr. 7, 89–94, 201 (1971).
W. M. Turski, A correspondence between thesaurus-based and multi-attribute retrieval systems, Inform. Stor. and Retr. 8, 309–313 (1972).
J. Vuillemin, “Une formalisation de la notion de structure de donnes,” Ph.D. Thesis, La Faculté de Sciences de Paris (1970).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Plenum Press, New York
About this chapter
Cite this chapter
Turski, W.M. (1976). Data Structure Models in Information System Design. In: Tou, J.T. (eds) Advances in Information Systems Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-8249-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-8249-6_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-8251-9
Online ISBN: 978-1-4615-8249-6
eBook Packages: Springer Book Archive