Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site deepthot.UUCP
Path: utzoo!watmath!deepthot!mary
From: mary@deepthot.UUCP (Mary MacVicar)
Newsgroups: ont.events
Subject: Seminar: TRANSAT - A System for Non-Deterministic Programming
Message-ID: <219@deepthot.UUCP>
Date: Wed, 14-Mar-84 11:03:58 EST
Article-I.D.: deepthot.219
Posted: Wed Mar 14 11:03:58 1984
Date-Received: Thu, 15-Mar-84 07:43:25 EST
Organization: UWO CS, London Canada
Lines: 32


                       PROF. A.K. DEWDNEY
                  DEPARTMENT OF COMPUTER SCIENCE
                 THE UNIVERSITY OF WESTERN ONTARIO

	                   will speak on

       TRANSAT - A System for Non-Deterministic Programming

                         A B S T R A C T

A "non-deterministic program" looks like a deterministic one except
that certain assignment statements are made to sets rather than vari-
ables.  Such programs are usually shorter and much easier to write
than their deterministic counterparts.  They can be translated by a
very efficient version of Cook's generic (NP-completeness) transfor-
mation into relatively small instances of the satisfiability problem.

This talk describes two TRANSAT systems and examines the possibility
of solving satisfiability problems very quickly up to some finite
threshhold of instance size.

                DATE:   Friday, March l6, 1984
                
	        TIME:   2:30 p.m.

                PLACE:  Middlesex College, Room 354


-- 
...!utzoo!uwo!deepthot!mary
(Mary Macvicar @ UWO Comp Sci, London Canada)