{"title":"Real-time reasoning with PROLOG","authors":"Chunsik Yi, Steven K. Graham","doi":"10.1145/99412.99437","DOIUrl":"https://doi.org/10.1145/99412.99437","url":null,"abstract":"In this paper, we present a description of a Prolog implementation of a system (RTR) for “real-time reasoning”, similar to those discussed by Perlis (see [3] and [6]). The reasoning to be performed by the system is “real-time” in two different senses. First, reasoning is considered to be a continuing process rather than an isolated calculation of the consequences of an axiom set, with such a process being analogous to that required to create a computer or robotic system with some autonomy. Secondly, our system addresses the combinatorial problems inherent in theorem proving by applying inference rules to only a small working set of observations and axioms. Such a system provides one approach to non-monotonic reasoning, allowing the derivation of inconsistent facts within the working set and then providing a means of resolving the conflict.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128299431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"System integration in multidatabases","authors":"P. Bodorik, J. Riordon","doi":"10.1145/99412.99455","DOIUrl":"https://doi.org/10.1145/99412.99455","url":null,"abstract":"— This paper presents an exploratory approach to the development of a tool for integrating existing databases. The intent is to meet specific requirements and to achieve flexibility through the creation of an “open” system. The methodology assumes an integration model which captures the essential characteristics of a distributed system within a knowledge base. The model and the underlying knowledge base may be used to represent the distributed environment and to define requirements for the shared use of heterogeneous databases. An interactive method is proposed which allows the user to proceed in an iterative fashion in specifying system attributes and resolving design conflicts. The project is at present in the definition phase; current work is aimed at the identification of generic multidatabase services, and their abstraction in a form amenable for storage in the knowledge base.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":" 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132075354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An object/message model for the development of integrated workstation software","authors":"Kathleen Taylor, M. Bauer","doi":"10.1145/99412.99427","DOIUrl":"https://doi.org/10.1145/99412.99427","url":null,"abstract":"There is a need for expandable, integrated workstation environments which are simple and straight-forward to use but which can be modified to accommodate a particular user's needs. In this paper, a model is proposed for the development of integrated workstation software. Integration is achieved through message passing and by encapsulating information in objects. The applications communicate with a mediator rather than each other. The mediator has descriptions of the objects being transferred and can carry out intermediate operations on the data when necessary. This paper introduces the basic concepts of the model, and briefly discusses a prototype and the future implications of this approach.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131725528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance comparison of extendible hashing and linear hashing techniques","authors":"Ashok Rathi, Huizhu Lu, G. Hedrick","doi":"10.1145/99412.99462","DOIUrl":"https://doi.org/10.1145/99412.99462","url":null,"abstract":"Based on seven assumptions, the following comparison factors are used to compare the performance of linear hashing with extendible hashing: 1. storage utilization; 2. average unsuccessful search cost; 3. average successful search cost; 4. split cost; 5. insertion cost; 6. number of overflow buckets. The simulation is conducted with the bucket sizes of 10, 20, and 50 for both hashing techniques. In order to observe their average behavior, the simulation uses 50,000 keys which have been generated randomly.\u0000According to our simulation results, extendible hashing has an advantage of 5% over linear hashing in terms of storage utilization. Successful search, unsuccessful search, and insertions are less costly in linear hashing. However, linear hashing requires a large overflow space to handle the overflow records. Simulation shows that approximately 10% of the space should be marked as overflow space in linear hashing.\u0000Directory size is a serious bottleneck in extendible hashing. Based on the simulation results, the authors recommend linear hashing when main memory is at a premium.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133479591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The cost-effective integration of microcomputers into a campus computing environment","authors":"Mark Luker","doi":"10.1145/99412.99444","DOIUrl":"https://doi.org/10.1145/99412.99444","url":null,"abstract":"This paper presents an integrated approach to the cost-effective support of microcomputers and their applications in an actual campus environment. Hardware and software standards, departmental LAN's, a campus network, large central computers, and organized training and consulting are used together to support many microcomputers efficiently, allowing more users and applications to be supported on the same budget. A well-known, public-domain networking package was extended to provide a crucial missing link in the plan. Such practical considerations of organized support can be of interest and value to the designers of the small systems of tomorrow.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116965448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A formal specification tool for office systems","authors":"H. Saiedian, E. A. Unger","doi":"10.1145/99412.99471","DOIUrl":"https://doi.org/10.1145/99412.99471","url":null,"abstract":"","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129389544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Parametric performance evaluation of a micro-based database system","authors":"R. Hashemi-Nassab","doi":"10.1145/99412.99458","DOIUrl":"https://doi.org/10.1145/99412.99458","url":null,"abstract":"An extended analytical technique for performance evaluation of software packages is introduced. The purpose of this analytical technique is to present the performance evaluation of a system in parametric equations. The equations can be easily used in studying the system behavior in different environments without re-evaluating the performance of the system. This technique was applied on a micro-based relational database system called MICREL. The performance criteria were the transaction delay and the processing delay. The result is a set of performance equations for different operations of MICREL.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126582248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"STP: a simple theorem prover for IBM-PC compatible computers","authors":"B. Mayfield, T. B. Baird","doi":"10.1145/99412.99439","DOIUrl":"https://doi.org/10.1145/99412.99439","url":null,"abstract":"STP (Simple Theorem Prover) was conceived as a tool to help gain a better understanding of the concepts and difficulties involved in producing a generalized automated theorem prover for first-order logic, such as ITP (Interactive Theorem Prover). The project was undertaken on an IBM-PC using Turbo Pascal, version 3, mainly for reasons of hardware availability and software familiarity. ITP is the model on which STP is based. Although STP is functionally much less complex than ITP, they share the same syntax for input clauses. An additional program, called the “Skolemizer”, was developed as a user aid to transform generalized first-order logic formulae into their Skolem conjunctive normal form equivalents for input to STP or to ITP. The initial strategy used to search the solution space proved to be inadequate for the development environment, and was later expanded to include a second search strategy option. The current version of STP uses LUSH resolution plus clause factoring to do refutation proofs. It is able to solve most simple problems, but takes too long to solve significant problems. Although STP met its design goal—that of being an educational experience to develop—it needs to be extended to utilize more complex forms of resolution and other related methods. With recent advances in small computer hardware and software capabilities, these enhancements should now be possible.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122238289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Edmund: a multicast kernel for distributed application","authors":"L. Hughes","doi":"10.1145/99412.99502","DOIUrl":"https://doi.org/10.1145/99412.99502","url":null,"abstract":"Although many local area networks and operating systems support the use of multicast communications, multicast communications have remained primarily an interesting research tool. However, the growing research interest in multimedia and hypermedia for knowledge-based models and cooperative work environments, and the need for object migration in distributed systems, suggest that there are other applications that could benefit from the use of multicast.\u0000This paper presents an overview of Edmund, a light weight kernel that supports interprocess multicast messaging on a network of Intel 80286 personal computers, as well as some of our preliminary research results which demonstrate the uses and benefits of multicast communication.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130794859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of a VLSI layout tool on personal computers","authors":"A. G. Jost, P. Streatch, D. Guptill","doi":"10.1145/99412.99463","DOIUrl":"https://doi.org/10.1145/99412.99463","url":null,"abstract":"This paper describes a VLSI layout editor implemented on the Macintosh and IBM personal computers. The editor is capable of manipulating integrated circuit designs of complexity exceeding 50,000 transistors on a standard Macintosh Plus computer. The paper discusses the design tradeoffs necessary to implement a program of this capability on small computers.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116601989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}