Seminars | Computational Logic Laboratory

Papers written by our lab members

Software tools developed by lab members

A comprehensive list of links

Weekly Informal Computational Logic Seminars

To be added to the Computational Logic Seminars email list, please send mail to cl@cs.sfu.ca

Summer 2005 Plan: Meetings Thursdays 1:30pm - 2:20pm, ASB 9705 .
Date	Room	Speaker(s)	Title
June 9, 2005	ASB 9705	Wei Luo	Mind Change Efficient Learning
June 16, 2005	ASB 9705	Torsten Schaub, University of Potsdam	Platypus: A Platform for Distributed Answer Set Solving
June 23, 2005	ASB 9705	Daphne Liu	COBA: A Consistency-Based Approach for Belief Change
July 7, 2005	ASB 9705	Kam Sing Leung	Makinson and van der Torre's Deontic Logics
July 21, 2005	ASB 9705	Mayu Ishida	TBA

Spring 2005 Plan: Meetings Thursdays 1:30pm - 2:20pm, ASB 9705 (unless otherwise posted).
Date	Room	Speaker(s)	Title
Feb. 24, 2005	ASB 9705	Antonina Kolokolova	Describing versus Proving
March 3, 2005	ASB 9705	Leopoldo Bertossi, Carleton University	An Overview of Consistent Query Answering in Databases
March 10, 2005	ASB 9705	Jeff Pelletier	On Post's Functional Completeness
March 17, 2005	ASB 9705	Bruce Spencer, National Research Council	Software Engineering for Semantic Web Service Composition
March 24, 2005	ASB 9705	Oliver Schulte	Frequent Queries in Logical Query Languages
March 31, 2005	ASB 9705	Jeff Pelletier	Automated Theorem Proving in Modal Logic
April 7, 2005	ASB 9705	Eugenia Ternovska	A Framework for Representing and Solving NP Search Problems
April 21, 2005	ASB 9705	Hector Levesque, University of Toronto	Planning with Loops

Fall 2004 Plan: Meetings Thursdays 1:30pm - 2:20pm, ASB 9705 (unless otherwise posted).
Date	Room	Speaker(s)	Title
Oct. 21, 2004	ASB 9705	Geoff Sutcliffe, University of Miami	Automated Theorem Proving for Hard Theorems in Rich Theories
Oct. 14, 2004	ASB 9705	Nikolay Pelov	An Answer Set Programming Tutorial
Oct.7, 2004	ASB 9705	Nikolay Pelov	Answer Set Programming with Aggregates
Sept. 30, 2004 1:30pm	ASB 9705	Tsuyoshi Morioka, University of Toronto	On the relationship between the complexity of total search problems and the hardness of proving their totality
Sept. 30,2004 12:30pm	ASB 9705	Greg Restall, University of Melbourne	The Geometry of Classical Logic (with quantifiers)
Sept. 23, 2004	ASB 9705	-	Introduction to the Computational Logic Lab

Summer 2004 Plan: Meetings Thursdays 1:30pm - 2:20pm, ASB 9705 (unless otherwise posted).
Date	Room	Speaker(s)	Title
June 10, 2004, 9:30am-4:30pm	K 9509	KR/NMR 2004 Speakers	Knowledge Representation and Reasoning day at SFU
May 20, 2004	ASB 9705	Jens Happe	Efficient Reasoning with Labelled Formula Translations of K
Tues. May 4, 2004 @ 1:30p	ASB 9896	Peter Scotch, Dalhousie	What is the logic of logical necessity?

Spring 2004 Plan: Meetings Thursdays 1:30pm - 2:20pm, ASB 9705 (unless otherwise posted).
Date	Room	Speaker(s)	Title
April 15, 2004	ASB 9705, 1:40p	Diana Cukierman	A Theory for Convex Interval Relations including Unbounded Intervals
March 30,2004	MBC 1300,2:30p	Torsten Schaub, Potsdam University	Answer Set Programming in a Nutshell
March 25,2004	K 8652	Ramesh Krishnamurti	The MINSAT Problem
March 18,2004	ASB 9705	Torsten Schaub, Potsdam University	Graphs and colorings for answer set programming
March 11,2004	ASB 9705	Joey Hwang	Resolution Proof Complexity of Constraint Satisfaction
Feb.26, 2004	ASB 9705	Eric Evangelista	A Knowledge-Level View of Consistent Query Answering
Feb.12, 2004	ASB 9705	Mayu Ishida	From CTL to Datalog
Feb.5, 2004	ASB 9705	Jeff Pelletier	Theorem Proving in Fuzzy Logic
Jan.29, 2004	ASB 9705	Ray Jennings	Or
Jan.15, 2004	ASB 9705	Toby Walsh, University College Cork	Symmetry in Constraint Programming

Past Seminars 2001-2003