SOFTWARE DEPARTMENT

- 1990 -

• 1/90 Modularity of knowledge. 20 p.
• 2/90 Higher order dataflow schemas. 23 p.
• 3/90 Type-theoretical semantics of some declarative languages. 18 p.
• 4/90 First-order correctness proofs for propositional logic programming. 28 p.
• 5/90 Knowledge-based programming environments. 36 p.
• 6/90 Knowledge based data modelling technique. 15 p.
• 9/90 C-Priz - a new generation software tool for small computers. 33 p.
• 10/90 The models of natural and formal languages. 40 p. (in Estonian).
• 11/90 Toward knowledge-based specification of languages. 13 p.
• 13/90 Using resolution for deciding solvable classes and building finite models. 32 p.
• 14/90 First-order correctness proofs for propositional logic programming. 29 p.
• 15/90 Functional programming. 12 p.
• 16/90 X-Window terminal hardware. 37 p. (in Estonian).

- 1991 -

• 17/91 Declarative programming in a type theory. 27 p.
• 18/91 An approach to designing object-oriented languages and environments. 12 p.
• 19/91 NUT: An object-oriented system with automatic synthesis of methods. 16 p.
• 20/91 Merging graphical and textual specification languages. 20 p.
• 21/91 Proof search in linear logic. 16 p.
• 22/91 An experimental system for implementation of attribute grammars: Users guide. 10 p. (in Estonian).
• 23/91 Attributed finite automata. 15 p.
• 24/91 Multilayered systolic arrays for convolution-like calculations. 11 p.
• 25/91 Time concepts in software. 16 p.
• 26/91 Embedded software modelling methodology used for analysing CIM systems. 25 p.
• 27/91 Artificial intelligence in hard real time -- a new paradigm needed? 15 p.
• 28/91 Knowledge representation and application II: Large knowledge-bases. 84 p.
• 29/91 CONRAD -- a system for evaluating behavioural properties of embedded software. 18 p.
• 30/91 Real-time specification and modeling with joint actions. 10 p.
• 31/91 Time-tolerant transformations of joint action system. 12 p.
• 32/91 Intelligent programming environments. 38 p.
• 33/91 Cognitive graphics. 23 p.
• 34/91 An object-oriented approach to conceptual data modelling. 15 p.
• 35/91 Small knowledge-based CAD systems. 11 p.
• 36/91 ExpertPRIZ - an integrated expert system shell. 34 p.
• 37/91 The formal model for the language LSD and calculus CSD. 17 p.
• 38/91 The language LSD and calculus CSD - tools for embedded system specification. 11 p.
• 39/91 Resolution methods for decision problems and finite-model building. 95 p.
• 40/91 One-dimensional processor arrays for solving triangular linear systems. 17 p.
• 41/91 Information system of Estonian Customs Board. Parts 1-3. 180 p. (in Estonian).

- 1992 -

• 42/92 Interaction of data streams in 1D processor arrays. 17 p.
• 43/92 Attribute grammars and computational models as combined language development tools. 15 p.
• 44/92 Normalization for arithmetical comprehension with restricted occurrences of Hilbert's epsilon symbol. 12 p.
• 45/92 Terminating epsilon substitutions process for the second order logic. 12 p.
• 46/92 Resolution calculus for a logic of knowledge. 9 p.
• 47/92 Object-oriented data models and methods of computations. 14 p.
• 48/92 Using partial deduction for automatic propagation of changes in OODB. 14 p.
• 49/92 Normalization for the first order classical logic with Hilbert's epsilon-symbol. 10p.
• 50/92 Documentation for hobbit version 0a. 10 p.
• 51/92 Proof search in linear logic. 25 p.
• 52/92 On formal models of finite attributed automata. 48 p.
• 53/92 Specification analysis. 48 p.
• 54/92 Computer logic overview of research activities in 1992.10 p.

- 1993 -

• 55/93 Epsilon substitution method for elementary analysis. 41 p.
• 56/93 On a proof-theoretical analysis of sigma_1^1 - AC, sigma_1 ^1 - DC and delta_1^ - CA. 11 p.
• 57/93 Constraint programming: NATO ASI on constraint programming, held in Parnu, Estonia, Aug.13-24, 1993: Student's
• 58/93 Constraint semantics of NUT. 35 p.
• 59/93 Algebraic theory of tape-controlled attributed automata.28p.
• 60/93 An object-oriented environment based on multi-layer application design. 20 p.
• 61/93 Language, tools and methods for conceptual modelling. 49 p.
• 62/93 Computer aided design of continuous beams. 31p. (in Estonian)
• 63/93 Theoretical computer science. 115 p. (in Estonian).
• 64/93 Computer aided design. 130 p. (in Estonian).
• 65/93 Some timing problems in interprocess communication of real-time embedded systems.24 p.
• 66/93 Some problems in timing analysis of the specification. 9 p.

- 1994 -

• 67/94 Preliminary research to develop the C-Priz system. 34 p. (in Estonian).
• 68/94 Theoretical computer science. Part II. 67 p. (in Estonian) [Part I. CS 63/93, new vers. CS 70/94].
• 69/94 Knowledge-based techniques for network management. 20 p.
• 70/94 Theoretical computer science I : Lecture notes. 91 p. (In Estonian)(Part II: CS 68/93).
• 71/94 Attributed automata: A formal model for protocol specification. 51 p.
• 72/94 Comparison of the modelling power of Petri-nets and Q-model. 60 p. (In Estonian).
• 73/94 Knowledge based systems. 59 p.
• 74/94 Software engineering: Lecture Notes. 146 p. (In Estonian).
• 75/94 Attributed automata - some results and open problems. 25 p.
• 76/94 Automatic programming: Lecture notes. 89 p. (In Estonian).
• 77/94 Using the NUT system for network management. 16 p.

- 1995 -

• 78/95 Parsing of C-Priz language. 22 p. (In Estonian).
• 80/95 Attributed models of executable specifications. 28 p.
• 81/95 Experimental program package in NUT system. 35 p.
• 82/95 A flexible model for dynamic (re)classification of objects. 12 p.
• 83/95 A note on completeness of partial deduction. 5 p.
• 84/95 Knowledge based software techniques /J. Penjam et al.
• 85/95 A modal justification for structural synthesis of NUT. 23 p.

- 1996 -

• 86/96 Models for contextual specification and analysis of knowledge. 27 p. (In Estonian).
• 88/96 General methods in inductive program synthesis. 23 p.
• 89/96 Structural program synthesis using regular data structures. 12 p. (in Estonian)
• 90/96 Models of attributed automata. 27 p.
• 91/96 Knowledge based software techniques.

- 1997 -

• 92/97 On two algebraic constructions for automata. 27 p.
• 93/97 Discovery of object-oriented schema and schema conflicts. 15 p.
• 94/97 Intellektitehnika ja kõrgjõudlusega arvutivõrgud = Artificial intelligence and high performance computer networks : Tehniline aruanne CS 94/97 /J.Penjam, A. Kalja, E.Tõugu jt. 13 lk.

- 1998 -

• 95/98 On projective semimodules over commutative semirings. 8 p.
• 96/98 Flatness and localization for omega-semigroups. 49 p. (in Russian).
• 97/98 CAD package for designing powers screws in NUT. 96 p. (in Russian).
• 98/98 Application package for querying data about height from Estonia digital map. 76 p. (in Russian).
• 99/98 Application package for designing gear drive in NUT. 107 p. (in Estonian).
• 100/98 Probabilistic automata and inductive problem solving. 27 p.

- 1999 -

• CS 101/99 On projective semimodules over commutative additively idempotent semirings. ii, 15 p.
• CS 102/99 Automata accepting coupled-context-free languages. ii, 15 p.
• CS 103/99 Ogden's lemma for coupled-context-free languages; the set of Lyndon words is not coupled-context-free. ii, 15 p.
• CS 104/99 Software technology: Fenno-Ugric Symposium FUSST'99, August 19-21, 1999, Sagadi, Estonia: Proceedings. vi, 279p.

 - 2001 -

• CS 105/2001 On Non-wellfounded constructive set theory: construction of non-wellfounded sets in explicit mathematics. 16 p.
  

- 2002 - 

• CS 106/2002 Linear logic programming for AI planning. Master thesis, 85 p.
  

- 2003 -

• CS 107/2003 A case study for program construction by means of evolutionary algorithms. 14 p.
• CS 108/2003 Evolutsioonilised algoritmid ja nende rakendamine neuronvõrkude õpetamiseks ja genereerimiseks. 74 p.
• CS 109/2003 Extendable visual language for specification of schemes. 15 p.