From newshub.ccs.yorku.ca!torn!cs.utexas.edu!sun-barr!ames!haven.umd.edu!darwin.sura.net!dtix!mimsy!dawn Sat Oct 24 20:44:56 EDT 1992
Article 7381 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!torn!cs.utexas.edu!sun-barr!ames!haven.umd.edu!darwin.sura.net!dtix!mimsy!dawn
>From: dawn@umiacs.umd.edu (Dawn Vance)
Newsgroups: comp.ai.philosophy
Subject: JICSLP '92 - Program for Workshop #1
Message-ID: <61393@mimsy.umd.edu>
Date: 23 Oct 92 14:17:08 GMT
Sender: news@mimsy.umd.edu
Organization: UMIACS, University of Maryland, College Park, MD 20742
Lines: 67


			    PROGRAM


             Workshop on Structural Complexity and 
        Recursion-theoretic Methods in Logic Programming

                            at the

 Joint International Conference and Symposium on Logic Programming

                  Friday, November 13, 1992
	      Ramada Renaissance Tech World Hotel
		        Washington, D.C.


8:00 - 8:25   A Survey of complexity and Undecidability Results 
              in Logic Programming
                     John S. Schlipf

8:25 - 8:50   Aggregation, Computability, and Complete Query Languages
                     Inderpal Singh Mumick
                     Oded Shmueli

8:00 - 9:15   Complexity of Computing with Extended Propositional 
              Logic Programs
                     Miroslaw Truszczynski
                     V. Wiktor Marek
                     Arcot Rajasekar

9:15 - 9:40   Abstract Properties and Computational Complexity of 
              Semantics for Disjunctive Logic Programs
                     Jurgen Dix
                     Martin Mueller

9:40 - 10:00  BREAK

10:00 - 10:25 On the Structural Simplicity of Machines and Languages
                     Yael Moscowitz
                     Ehud Shapiro
              
10:25 - 10:50 Complexity Results for Logic-Based Abduction
                     Thomas Eiter
                     Georg Gottlob

10:50 - 11:15 A Topological Characterizatio of the Stable and 
              Minimal Model Classes of Propositional Logic Programs
                     Audrey Ferry
                               
11:15 - 11:30 BREAK            
                               
11:30 - 11:55 Rule Systems and Well-Orderings
                     V. Wiktor Marek
                     Anil Nerode
                     Jeffrey  C. Remmel

11:55 - 12:20 On Computability by Logic Programs
                     Andrei Voronkov

12:20 - 12:45 Halting Problem of One Binary Horn Clause is Undecidable
                     Philippe Devienne
                     Patrick Lebegue
                     Jean-Christophe Routier         
                               
12:45 - 14:00 Lunch, discussion and rump session 
_____________________________________
For additional information contact Howard Blair - blair@top.cis.syr.edu


