Dept. of Computer and Information science, Linköping University
Last updated: Tue, 02 Dec 1997 11:01:54
Deransart, P. and Maluszynski, J. (1985). RELATING LOGIC PROGRAMS AND ATTRIBUTE GRAMMARS (Revised version). Technical Report LiTH-IDA-R-85-08, Department of Computer and Information Science, Linköping University, Sweden. Revised version (LiTH-IDA-R.84-07) Also in Journal of Logic Programming. (bibtex),
Abstract: This paper shows that logic programs and attribute grammars are closely related. Constructions are given which transform logic programs into semantically equivalent attribute grammars, and vice versa. This opens for application in logic programming of some methods developed for attribute grammars. These results are used to find a sufficient condition under which no infinite term can be created during a computation of a logic program, and to define a nontrivial class of logic programs which can be run without employing unification in its general form.
Drabent, W. (1985). An Experiment with Domain Construction for Denotational Semantics. Technical Report LiTH-IDA-R-85-17, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: No abstract available
Einarsson, B. (1985). The Structure of Mixed Language Programming Realization. Technical Report LiTH-IDA-R-85-01, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: The topic of mixed language programming, or inter language communication, has in recent years received greater attention than before. This is partly due to the successful introduction of the new languages Ada* and Pascal, together with the strong survival of the classical languages Basic, Cobol, and Fortran. This paper stresses the importance of mixed language programming, discusses some of the associated problems, and gives a structured view on the various ways to realize mixed language programming.
Fagerström, J. (1985). Experiences with Occam: A Simulator for Asynchronous Processes. Technical Report LiTH-IDA-R-85-14, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the Hawaii International Conference on System Sciences, HICSS-19, Hawaii, 1985.Proc. of the Hawaii International Conference on System Sciences, HICSS-19, Hawaii, 1985. (bibtex),
Abstract: This paper describes a register level simulator for a family of architectures based on asynchronous processes. Within this architecture we hope to avoid the usual bottlenecks of Von Neumann machines and at the same time avoid the problem of dynamically binding every operation as in dataflow machines. The simulator is written in a language called Occam, in which parallel execution at the statement level can be expressed. A short description of the language is given and some of the issues of design, testing and maintaining concurrent programs are discussed.
Kuchinski, K. and Peng, Z. (1985). Microprogramming Implementation of Timed Petri Nets. Technical Report LiTH-IDA-R-85-19, Department of Computer and Information Science, Linköping University, Sweden. Also publ in North-Holland INTEGRATION, the VLSI Journal No 5, 1987. (bibtex),
Abstract: This paper describes a method to implement restricted timed Petri nets by microprograms. These timed Petri nets are used to represent control parts of VLSI systems to produce sequences of control signals that evoke the operations of a corresponding data part. The proposed method consists of a set of transformation algorithms which have been implemented as parts of CAMAD, an integrated design aid system. We have also studied the problem of microprogram optimization, for example, how to reconstruct the control structure of a VLSI system so as to produce better microprograms.
Lawson, Jr., and W., H. (1985). Architecting VLSI Systems. Technical Report LiTH-IDA-R-85-03, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the ASEAN-EEC Seminar "Introduction to Integrated Circuit Design", Singapore, 19-22 July 1983. (bibtex),
Abstract: In developing digital logic based integrated circuit systems, one must first consider the strategic decisions of the design (i.e. development of the abstract concepts and principles of the system). The second step is the synthesis by manual, semi-automatic or automatic methods. In this paper, we concentrate upon many of the issues of the first step; namely the "architecture" by considering such aspects as: the nature of the system to be developed, timing and synchronization, floor plans, the use of regular logic structures, programmable logic, vertical function migration, packaging building blocks and architectural description.
Lawson, Jr., and W., H. (1985). Impact of CAD and Integrated Circuit Developments on Telecommunication. Technical Report LiTH-IDA-R-85-02, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the European Teleinformatics Conference in Varese, Italy, 3-6 October, 1983. (bibtex),
Abstract: Several research and development trends in the area of CAD for electronics are identified. CAD is presented as an essential tool for realizing creativity in the design of telecommunication and computer system hardware and software products. The use of analogies as a method to stimulate creativity is considered. The advantages and disadvantages of standardization in respect to creativity is discussed. After discussing some important properties and limitations of MOS (Metallic-Oxide-Semiconductor) devices, several important issues related to architecting future telecommunication and computer systems are presented. The impact of new media, especially graphic equipment, is considered. Possibilities for improving human-to-human communication about design and the importance of improving our educational activities are discussed.
Lingas, A. (1985). A Linear-Time Heuristic for Minimum Weight Triangulation of Convex Polygons. Technical Report LiTH-IDA-R-85-12, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the Allerton Conference on Communication, Control, and Computing, Urbana, Illinois, October, 1985. (bibtex),
Abstract: A simple heuristic for minimum weight triangulation of convex polygons is presented. For a convex polygon with n vertices, the heuristic runs in time O(n), and produces a solution within an O(logn) factor from the minimum. Generalizations of the heuristic to include non-convex polygons are also derived.
Lingas, A. (1985). On Partitioning Polygons. Technical Report LiTH-IDA-R-85-13, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 1st ACM Symposium on Computational Geometry, Baltimore, Maryland, June 5-7, 1985. (bibtex),
Abstract: Chazelle has shown how to partition any simple polygon P into two polygons, each of total weight not greater than two thirds of the total weight of P, by drawing a diagonal within P. Under the assumption that a triangulation of P is given, we provide a straightforward proof of Chazelles theorem and derive generalizations of the theorem to include polygons with polygonal holes. The generalizations are main results of the paper.
Lingas, A. (1985). Subgraph Isomorphism for Easily Separable Graphs of Bounded Valence. Technical Report LiTH-IDA-R-85-15, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of International Workshop on Graphtheoretic Concepts in Computer Science, Castle Schwanberg, Wuerzburg, Germany, June 18-21, 1985. (bibtex),
Abstract: A general method for solving the subgraph isomorphism for connected graphs with s(n)-separator and valence bounded by d(n) is presented. The method takes exp(O((d(n)+logn)s(n)logn)) time.
Peng, Z. (1985). A Unified Approach to Design Representation and Synthesis of VLSI Systems. Technical Report LiTH-IDA-R-85-18, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 19th Annual Hawaii International Conference on System Sciences, Jan 8-10, 1986. (bibtex),
Abstract: This paper describes a unified design representation and its application in synthesizing VLSI systems. The synthesis process consists of sequence of semantics-preserving mappings transforming a program-like behavioral description into a structural description, which may then be partitioned into several potential asynchronous modules with well-defined interfaces. The proposed design representation model leads to the effective use of CAD and automatic tools in the synthesis process and the possibility of verifying some aspects of a design before it is completed.
Rehmnert, R., Sandahl, K., and Granstedt, O. (1985). Knowledge Organization in an Expert System for Spot-Welding Robot Configuration. Technical Report LiTH-IDA-R-85-10, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 5th Int. Workshop on Expert Systems and Their Applications, Avignon, 1985. (bibtex),
Abstract: The GARMAN project (sales support for spot-welding robot configuration) was carried out in cooperation between ASEA, the largest Swedish manufacturer of electrical equipment and one of the world leaders in manufacturing of industry robots, and Linköping University. The main task of the system is to support a sales engineer in the configuration of a spot-welding robot. Important aspects are to ensure that relevant and complete information is acquired from the customer, to suggest a suitable combination of equipment and to verify that electrical and mechanical constraints are satisfied. Additional complications arise from the fact that customer preferences must be taken into account and that equipment from different vendors has to be fitted together. The EMYCIN system from Stanford was used as the basic tool to realize the current prototype system, although significant parts of the problem were solved directly in Lisp, mainly because initial assumptions regarding parameter value may have to be relaxed.
Rönnquist, R. (1985). Relational Algebra in I.M.S. Theory. Technical Report LiTH-IDA-R-85-06, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: On basis of the notion of a semantic database, and by utilizing the theory of Information Management Systems, we study the schema concept in a relational database and give a formal description of the schema handling implied by operations of relational algebra. Our frame-work presents a natural conceptualization of database schemes, independent of the actual design model, and enables further investigations to be made on a formal ground.
Sandahl, K. (1985). Creating an Antibody Analysis Advisor as an Exploratory investigation into Expert System Development. Technical Report LiTH-IDA-R-85-20, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: Intelligent assistance for the selection of diagnosing techniques shows a high potential for increased accuracy, reliability and cost efficiency in many areas, not the least in medicine. An expert system, called A3, for guidance in the selection of analysis techniques for blood samples has been developed. Preliminary tests show that the advice given by the system reaches expert level, resulting in significant higher precision than current practices at the hospital. We give an introduction to identification of irregular antibodies as our problem domain, describe the A3 knowledge base and comment upon the development work including the knowledge acquisition process. Finally we discuss our experiences and the motivation for a subsequent project, where A3 has been migrated from the original EMYCIN environment to a delivery system based on the MUMPS database system.
Sandahl, K., Hägglund, S., Hilde'n, J.-O., Rehmnert, R., and Reshagen, L. (1985). The Antibody Analysis Advisor and its Migration into a Production Environment. Technical Report LiTH-IDA-R-85-16, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 1st Int. Conf. on Expert Systems, London 1985. (bibtex),
Abstract: No abstract available
Sandewall, E. (1985). A Functional Approach to Non-Monotonic Logic. Technical Report LiTH-IDA-R-85-07, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of IJCAI-85, Los Angeles, 1985. (bibtex),
Abstract: No abstract available
Siemienski, P. (1985). Towards an Integrated VLSI CAD System the Database and its Implementation. Technical Report LiTH-IDA-R-85-04, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: The complexity of VLSI circuits creates a challenge to the skills of IC designers. Reduction of the problems complexity is possible by decomposing it in several dimensions: as a sequence of models, through hierarchy within models, and by utilization of regularity. The set of models, model-to-model transformations and design constraints define the design method supported by the CAD system.