From:                     Kendra Smith

Sent:                      Tuesday, January 25, 2000 10:33 PM

To:                         M?crosöft Research Tech Talk, Sem. Notice

Cc:                         Kendra Smith

Subject:                 UW-CSE Colloq / 2-3-2000 / Jaffar / Singapore National University / Open Constraint Programming

UW-CSE Colloq / 2-3-2000 / Jaffar / Singapore National University / Open Constraint Programming

 

*NOTE* This lecture will be broadcast live via the Internet. See

http://www.cs.washington.edu/news/colloq.info.html for more information.

 

UNIVERSITY OF WASHINGTON

Seattle, Washington 98195

 

Department of Computer Science and Engineering

Box 352350

(206) 543-1695

 

COLLOQUIUM

 

SPEAKER:      Joxan Jaffar, Singapore National University

 

TITLE:          Open Constraint Programming

 

DATE:           Thursday, February 3, 2000

 

TIME:           3:30 pm

 

PLACE:                   134 Sieg

 

HOST:           Alan Borning

 

ABSTRACT:

 

We present a framework for reactive programming over a shared store. A key

requirement is that the store can be modelled as a highly-structured

entity such as a database or logical theory.  The main elements are

obtained from combining ideas in active databases, concurrent programming

and constraints.  In traditional databases, interactions are queries on a

static database, and queries are not designed for cooperative behavior.

In traditional concurrent programming, database update and concurrency

control issues are not in focus.  A closer comparison is constraint

programming whose interactions with a constraint store was a central

advantage. Disadvantages, however, include a dependence on a programming

language, monotonicity in the store and a restricted form of concurrency.

 

In this talk, we present a wrapper framework in general terms, and discuss

new application directions.  We will emphasize that

 

- there is user-level control of concurrency in order to deal with issues

of synchonization, atomicity and transactions

 

- there is no tie-in to a programming language; instead, program fragments

or {\it reactors} are embedded  in arbitrary agents

 

- there is a general architecture highlighting the central algorithms

which provides a basis for efficient implementations.

 

(Joint work with Limsoon Wong and Roland Yap)

 

Refreshments to follow.

 

Email: talk-info@cs.washington.edu

Info: http://www.cs.washington.edu