{"title":"A parallel implementation of cost-based abductive reasoning","authors":"Shohei Kato, H. Seki, H. Itoh","doi":"10.1145/266670.266699","DOIUrl":"https://doi.org/10.1145/266670.266699","url":null,"abstract":"This paper describes efficient parallel first-order cost-based abduct ive re~oning for distributed memory systems. A search control technique of parallel best-first search is introduced into abductive reasoning mechanism, thereby finding much more efficiently a minimal-cost explanation of a given observation. A dynamic approach to selecting processor to which work should be dwtributed is designed for parallel abductive reasoning. We propose a PARallel Costbaaed Abductive Reasoning system, PARCAR. We also implement PARCAR on an MIMD distributed memory parallel computer, Fujitsu AP 1000, and show some performance results with a speed-up comparable to the existing distributed heuristic search.","PeriodicalId":123389,"journal":{"name":"International Workshop on Parallel Symbolic Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130750763","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":"CABAL: polynomial and power series algebra on a parallel computer","authors":"A. Norman, J. ffitch","doi":"10.1145/266670.266729","DOIUrl":"https://doi.org/10.1145/266670.266729","url":null,"abstract":"The work on designing or adapting algebra systems to exploit parallel hmdware that we have seen to date has concentrated on trying the speed-up that can come from concurrent exploration of branches in search trees or overlapped computation in demanding algorithms. We in this paper, on the other hand, are almost exclusively concerned with the fact that large-scale parallel computers are frequently configured with very large amounts of primary memory. Our system distributes very large formulae across the multiple processors in such a parallel computer in such a way that calculations that would otherwise fail for lack of memory can be completed. Our initial system described here is designed to perform simple polynomial and power series calculations, but even in such apparently limited domains the easing of memory restrict ions can sometimes prove useful. Results from our system, called CABAL (Cambridge And Bath ALgebra-system), are included both from rune on sm~l networks of conventional workstations and using a Hitachi SR2201 massively parallel super-computer. The main result is a demonstration of the feasibility of the design.","PeriodicalId":123389,"journal":{"name":"International Workshop on Parallel Symbolic Computation","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116422362","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":"Extended dynamic dependent and-parallelism in ACE","authors":"Enrico Pontelli, G. Gupta","doi":"10.1145/266670.266691","DOIUrl":"https://doi.org/10.1145/266670.266691","url":null,"abstract":"We present an extension of Dynamic Dependent Andparallel scheme in which deterministic consumer goals are allowed to bind the dependent variable. The extended scheme leads to: (i) improved efficiency due to pruning of program search space; and, (ii) exploitation of more parallelism due to increased overlapping of dependent executions. In dynamic dependent and-parallel execution, given a parallel conjunction with a shared variable X, the leftmost goal is normally designated as the producer of the binding for X, all others goals are designated as consumers. If the producer goal finishes execution without binding X, then the leftmost consumer goal becomes the next producer and so on. In the extended scheme a deterrninktic consumer goal is also allowed to bind the dependent variable. Our extension leads to incorporation of coroutining in a dynamic dependent and-parallel system. The extended dynamic dependent and-parallel scheme can be regarded as a weak form of the Eztended Andorm Mode!. The implementation of the extended scheme has been realized, based on the Filtered Binding Model for implementing dependent and-parallelism, and has shown excellent results.","PeriodicalId":123389,"journal":{"name":"International Workshop on Parallel Symbolic Computation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133712625","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":"Object graph rewriting: an experimental parallel implementation","authors":"J. Glauert","doi":"10.1145/266670.266709","DOIUrl":"https://doi.org/10.1145/266670.266709","url":null,"abstract":"Object Graph Rewriting (OGRe) is a computational model which combines ideaa from graph rewriting and process calculi. OGRe has been designed for implementing multiparad@n languages such as Facile, which combines functional and concurrent programming. Simple objects, which have states represented by treestructured terms, respond to messages, also represented = terms. New objects may be created and new messages sent, while the original object either remains unaf%cted or changes state. The model is inherently concurrent, but finegrained, so distributed implementation is not necessarily beneficial. We introduce OGRe with some simple examples and explain how primitives are added which can trigger concurrent execution when appropriate.","PeriodicalId":123389,"journal":{"name":"International Workshop on Parallel Symbolic Computation","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126937169","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}