DI PIERRO AND WIKLICKY

Logic and Computation
PROBABILISTIC LOGIC AND RANDOMISED COMPUTATION

Workshop

ALESSANDRA DI PIERRO and HERBERT WIKLICKY

Department of Computer Science, City University of London

First week
adp@cs.city.ac.uk and herbert@cs.city.ac.uk

Course description

Probabilistic concepts recently gained widespread interest in logic and computer science, for example in the investigation of randomised algorithms and probabilistic proof systems.

But whereas probability and randomisation has always played an important role in complexity theory (from average case analysis to probabilistic complexity classes) the investigation of these notions in semantics was much more limited and only in the last years renewed interest seems to develop.

This workshop aims at bringing together researchers from areas like philosophy, logics, semantics and algorithmic theory whose research in some way is concerned with aspects of probability, stochastic processes, randomised algorithms etc. in order to foster links and facilitate cross-fertilisation of ideas among them.

Workshop topics include:
philosophical foundations of probability
probabilistic logics
probabilistic proof systems
probabilistic knowledge representation
probabilistic games
randomised automata
randomised algorithms
randomised optimisation (e.g. simulated annealing, genetic algorithms)
semantics of probabilistic languages
probabilistic non-determinism
probabilistic reasoning
fuzzy and belief systemsinexact matching
(stochastic) approximation
practical applications

Programme:

Monday, August 17:

Herbert Wiklicky: "Introduction"
Don Fallis: The Reliability of Randomized Algorithms"

Tuesday, August 18:

Stefan Riezler: "Statistical Inference for Probabilistic Constraint Logic Programming"
Alex Dekhtyar, V.S. Subrahmanian: "Proof Procedures for Hybrid Probabilistic Programs"

Wednesday, August 19:

A. Di Pierro: "Probabilistic Concurrent Constraint Programming
Tanya Valkevych, David Gilbert, A.A. Letichevsky:"Simulating PCCP Programs in the Action Language Workbench"

Thursday, August 20, 1998:

Daniel Robinson, Carroll Morgan: "Restricted Demonic Choice for Modular Probabilistic Programs"
Zoran Ognjanovic: "A Logic for Temporal and Probabilistic Reasoning"

Friday, August 21, 1998:

Discussion

Prerequisites
None

Literature
No specific recommendation

HOME PROGRAMME CONTACT REGISTRATION

Logic and Computation	PROBABILISTIC LOGIC AND RANDOMISED COMPUTATION
Workshop	ALESSANDRA DI PIERRO and HERBERT WIKLICKY Department of Computer Science, City University of London
First week	adp@cs.city.ac.uk and herbert@cs.city.ac.uk
Course description	Probabilistic concepts recently gained widespread interest in logic and computer science, for example in the investigation of randomised algorithms and probabilistic proof systems. But whereas probability and randomisation has always played an important role in complexity theory (from average case analysis to probabilistic complexity classes) the investigation of these notions in semantics was much more limited and only in the last years renewed interest seems to develop. This workshop aims at bringing together researchers from areas like philosophy, logics, semantics and algorithmic theory whose research in some way is concerned with aspects of probability, stochastic processes, randomised algorithms etc. in order to foster links and facilitate cross-fertilisation of ideas among them. Workshop topics include: philosophical foundations of probability probabilistic logics probabilistic proof systems probabilistic knowledge representation probabilistic games randomised automata randomised algorithms randomised optimisation (e.g. simulated annealing, genetic algorithms) semantics of probabilistic languages probabilistic non-determinism probabilistic reasoning fuzzy and belief systemsinexact matching (stochastic) approximation practical applications Programme: Monday, August 17: Herbert Wiklicky: "Introduction" Don Fallis: The Reliability of Randomized Algorithms" Tuesday, August 18: Stefan Riezler: "Statistical Inference for Probabilistic Constraint Logic Programming" Alex Dekhtyar, V.S. Subrahmanian: "Proof Procedures for Hybrid Probabilistic Programs" Wednesday, August 19: A. Di Pierro: "Probabilistic Concurrent Constraint Programming Tanya Valkevych, David Gilbert, A.A. Letichevsky:"Simulating PCCP Programs in the Action Language Workbench" Thursday, August 20, 1998: Daniel Robinson, Carroll Morgan: "Restricted Demonic Choice for Modular Probabilistic Programs" Zoran Ognjanovic: "A Logic for Temporal and Probabilistic Reasoning" Friday, August 21, 1998: Discussion
Prerequisites	None
Literature	No specific recommendation