Filters








7 Hits in 0.98 sec

Page 169 of University Computing : The Bulletin of the IUCC Vol. 12, Issue 4 [page]

1990 University Computing : The Bulletin of the IUCC  
Finally, Nixdorf are developing an inference machine based on the PARTHEO parallel automated theorem prover. The LOP logic programming language is used as the PARTHEO input language.  ...  These were then used to extend the sequential abstract machine to make a parallel abstract machine.  ... 

METEORs: High Performance Theorem Provers using Model Elimination [chapter]

O. L. Astrachan, D. W. Loveland
1991 Automated Reasoning Series  
The significance of parallel ME in future thec.em provers stems from the availability (and even low cost) of parallel machines and the decomposability of theorem proving tasks, including search itself.  ...  In this paper we report on METEOR, a parallel implementation of ME (or-parallelism, to be precise) and compare it to the sequential version of the same inference engine as well as comparing the implementations  ... 
doi:10.1007/978-94-011-3488-0_2 fatcat:x7yc6muwnvg6rj3ruvbgwe6tze

Parallelization of deduction strategies: An analytical study

Maria Paola Bonacina, Jieh Hsiang
1994 Journal of automated reasoning  
Within this framework, we analyze many issues, including the dynamicity and size of the data base of clauses during the derivation, the possibility of conflicts between parallel inferences, and duplication  ...  Accordingly, we propose a notion of parallelism at the search level as coarse grain parallelism for deduction.  ...  The first author was also supported by a fellowship of Università degli Studi di Milano, Italy.  ... 
doi:10.1007/bf00881910 fatcat:weg2dzh255birnxqu6ciwoniv4

Coupled Problems in Microsystem Technology [chapter]

Hans-Joachim Bungartz, Stefan Schulte
1995 Notes on Numerical Fluid Mechanics (NNFM)  
Furthermore, this technique is perfectly suited for parallelization, especially for the use of (heterogeneous) workstation clusters.  ...  We present a classi cation of the most important occurring couplings, and we give a survey of existing solution techniques with emphasis on the so-called partitioned solution.  ...  Schumann: Parallelization of Inference Systems by using an Abstract Machine bisher erschienen : Reihe A 342/1/90 A Robert Gold, Walter Vogler: Quality Criteria for Partial Order Se- mantics of  ... 
doi:10.1007/978-3-322-86859-6_2 fatcat:hfklysimkzahpm6gdo3z6vgxdm

Checking system properties via integer programming [chapter]

Stephan Melzer, Javier Esparza
1996 Lecture Notes in Computer Science  
The marking equation is a well known veri cation method in the Petri net community. It has also be applied by Avrunin, Corbett et al. to automata models.  ...  It is a semidecision method, and it may fail to give an answer for some systems, in particular for those communicating by means of shared variables.  ...  Schumann: Parallelization of Inference Systems by using an Abstract Machine 342/25/91 A Eike Jessen: Speedup Analysis by Hierarchical Load Decomposition 342/26/91 A Thomas F.  ... 
doi:10.1007/3-540-61055-3_41 fatcat:vmm7frqdyfanvfqzian4thjnne

OR-parallel theorem proving with random competition [chapter]

Wolfgang Ertel
Logic Programming and Automated Reasoning  
With random competition we propose a method for parallelizing backtracking search. We can prove high efficiency of random competition on highly parallel architectures with thousands of processors.  ...  OR-parallel search in general.  ...  The speedup of PARTHEO on an Intet iPSC/2 Hypercube with 16 processors is 10.5 where random competition achieves a speedup of 8.6 with 16 processors on every parallel machine.  ... 
doi:10.1007/bfb0013064 dblp:conf/lpar/Ertel92 fatcat:fvf4x4q7q5hqno7v4cdjgsczr4

A Tableau Based Automated Theorem Prover Using High Performance Computing

Md Zahidul Islam, Ahmed Shah Mashiyat, Kashif Nizam Khan, S.M. Masud Karim
2012 Journal of Computers  
This paper also investigates two distinct approaches for parallel and distributed implementation and describes the experimental formula generation procedure.  ...  It can also be used to prove whether a formula is a logical consequence of a set of formulas.  ...  A. 3 T A P B. Meteor Meteor [17] compiles clauses into a data structure which is inferred by a sequential or parallel inference engine.  ... 
doi:10.4304/jcp.7.3.597-607 fatcat:3fx3hscdwvgglhlitnqnmsqvxm