Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!sdd.hp.com!wuarchive!uunet!mcsun!hp4nl!cwi.nl From: jmj@cwi.nl (Jacquet) Newsgroups: comp.lang.prolog Subject: ICLP'91 Preconference Workshop Message-ID: <3692@charon.cwi.nl> Date: 13 Jun 91 19:02:13 GMT Sender: news@cwi.nl Organization: CWI, Amsterdam Lines: 354 Program of the ICLP'91 Preconference Workshop on CONSTRUCTING LOGIC PROGRAMS June 24, 1991, Paris, France 8:00 Shuttle to INRIA (from place Charles de Gaulle - Etoile) 9:00 -- 10:45 : Session I Generating Simplification Lemmas using Extended Prolog Execution and Proof-extraction Laurent Fribourg, L.I.E.N.S., France. Schema-Guided Synthesis of Logic Programs, Pierre Flener, Yves Deville, Universite de Namur, Belgium Contributions to the Semantics of Open Logic Programs, Annalisa Bossi, Universita di Padova, Italy, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo, Universita di Pisa, Italy. A Note on Making Explicit Design Decisions, Jan Komorowski, The University of Trondheim, Norway. 10:45 -- 11:00 : Break 11:00 -- 12:45 : Session II Verification of Logic Programs and Imperative Programs, Lee Naish, University of Melbourne, Australia. Proving Universal Termination of a Logic Program, Annalisa Bossi, Nicoletta Cocco, M. Fabris, Universita di Padova, Italy. A semantic Approach to Prolog Program Analysis, Brian J. Ross, University of Edinburgh, United Kingdom Theory Construction in Computational Logic, Antonio Brogi, Paolo Mancarella, Dino Pedreschi, Franco Turini, Universita di Pisa, Italy. 13:00 -- 14:00 : Lunch Break 14:00 -- 15:45 : Session III Refinement Strategies for Inductive Learning of Simple Prolog Programs, Marc Kirschenbaum, John Carroll University, U.S.A., Leon S. Sterling, Case Western Reserve University, U.S.A. A Transformational Approach to Functional Requirements Prototyping, Naji Habra, Universite de Namur, Belgium, Axel van Lamsweerde, Universite Catholique de Louvain, Belgium. Deriving Logic Progrmas from Observations, David Gilbert, City University of London, United Kingdom, Christopher Hogger, Imperial College, United Kingdom. The Synthesis of Logic Programs from Inductive Proofs, Alan Bundy, Alan Smaill, Geraint Wiggins, University of Edinburgh, United Kingdom. 15:45 -- 16:00 : Break 16:00 -- 17:45 : Session IV Comparative Semantics of a Backtrackable Rendez-vous, Anton Eliens, Vrije Universiteit, The Netherlands. Nonstandard Answers of Elementary Logic Programs, Paul Tarau, Universite de Moncton, Canada, Michel Boyer, Universite de Montreal, Canada. Some Algorithms for Fast and Complete Execution of Logic Programs, Roland Olsson, University of Molde, Norway. Negation Expansion and Query Answering, Kanchana Kanchanasut, Peter Stuckey, University of Melbourne, Australia. 18:00 : Shuttle to place Charles de Gaulle -- Etoile ------------------------------------------------------------------------------ % Latex version %\documentstyle[11pt]{article} \documentstyle{article} \pagestyle{empty} % measures to be used for A4 format % measures to be used for American % % format \textheight 46\baselineskip % \textheight 46\baselineskip \marginparwidth 16 mm % \marginparwidth 16 mm \textwidth 15 cm % \textwidth 16 cm \evensidemargin 9 mm % \setlength{\evensidemargin}{0pt} \oddsidemargin 9 mm % \setlength{\oddsidemargin}{0pt} % \setlength{\topmargin}{-0.5 in} \begin{document} \newcounter{ci} \newenvironment{enumi}{ \begin{list}{I-\arabic{ci}}{\usecounter{ci} \setlength{\leftmargin}{8ex} \setlength{\labelwidth}{5ex} } }{ \end{list}} \newcounter{cii} \newenvironment{enumii}{ \begin{list}{II-\arabic{cii}}{\usecounter{cii} \setlength{\leftmargin}{8ex} \setlength{\labelwidth}{5ex} } }{ \end{list}} \newcounter{ciii} \newenvironment{enumiii}{ \begin{list}{III-\arabic{ciii}}{\usecounter{ciii} \setlength{\leftmargin}{8ex} \setlength{\labelwidth}{5ex} } }{ \end{list}} \newcounter{civ} \newenvironment{enumiv}{ \begin{list}{IV-\arabic{civ}}{\usecounter{civ} \setlength{\leftmargin}{8ex} \setlength{\labelwidth}{5ex} } }{ \end{list}} \begin{center} {\Large \bf Program of the} \\ \vspace{0.75ex} {\Large \bf ICLP\'{ }91 Preconference Workshop on} \\ \vspace{2ex} {\huge \bf Constructing Logic Programs} \\ \vspace{2ex} {\Large \bf June 24, 1991, Paris, France} \end{center} \vspace{2cm} \noindent {\large \bf 8:00 Shuttle to INRIA (from place Charles de Gaulle - Etoile)} \vspace{0.5cm} \noindent {\large \bf 9:00 -- 10:45 : Session I} \begin{enumi} \item {\em Generating Simplification Lemmas using Extended Prolog Execution and Proof-extraction,} \\ \hspace*{4ex} Laurent Fribourg, L.I.E.N.S., France. \item {\em Schema-Guided Synthesis of Logic Programs}, \\ \hspace*{4ex} Pierre Flener, Yves Deville, Universit\'{e} de Namur, Belgium \item {\em Contributions to the Semantics of Open Logic Programs}, \\ \hspace*{4ex} Annalisa Bossi, Universita d\`{\i} Padova, Italy, \\ \hspace*{4ex} Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo, Universita d\`{\i} Pisa, Italy. \item {\em A Note on Making Explicit Design Decisions}, \\ \hspace*{4ex} Jan Komorowski, The University of Trondheim, Norway. \end{enumi} \vspace{0.5cm} \noindent {\large \bf 10:45 -- 11:00 : Break} \vspace{0.5cm} \noindent {\large \bf 11:00 -- 12:45 : Session II} \begin{enumii} \item {\em Verification of Logic Programs and Imperative Programs,} \\ \hspace*{4ex} Lee Naish, University of Melbourne, Australia. \item {\em Proving Universal Termination of a Logic Program,} \\ \hspace*{4ex} Annalisa Bossi, Nicoletta Cocco, Maurizio Fabris, Universita d\`{\i} Padova, Italy. \item {\em A semantic Approach to Prolog Program Analysis,} \\ \hspace*{4ex} Brian J. Ross, University of Edinburgh, United Kingdom \item {\em Theory Construction in Computational Logic,} \\ \hspace*{4ex} Antonio Brogi, Paolo Mancarella, Dino Pedreschi, Franco Turini, \\ \hspace*{4ex} Universita d\`{\i} Pisa, Italy. \end{enumii} \vspace{0.5cm} \noindent {\large \bf 13:00 -- 14:00 : Lunch Break} \vspace{0.5cm} \noindent {\large \bf 14:00 -- 15:45 : Session III} \begin{enumiii} \item {\em Refinement Strategies for Inductive Learning of Simple Prolog Programs,} \\ \hspace*{4ex} Marc Kirschenbaum, John Carroll University, U.S.A., \\ \hspace*{4ex} Leon S. Sterling, Case Western Reserve University, U.S.A. \item {\em A Transformational Approach to Functional Requirements Prototyping,} \\ \hspace*{4ex} Naji Habra, Universit\'{e} de Namur, Belgium, \\ \hspace*{4ex} Axel van Lamsweerde, Universit\'{e} Catholique de Louvain, Belgium. \item {\em Deriving Logic Programs from Observations,} \\ \hspace*{4ex} David Gilbert, City University of London, United Kingdom, \\ \hspace*{4ex} Christopher Hogger, Imperial College, United Kingdom. \item {\em The Synthesis of Logic Programs from Inductive Proofs,} \\ \hspace*{4ex} Alan Bundy, Alan Smaill, Geraint Wiggins, Ina Kraan, \\ \hspace*{4ex} University of Edinburgh, United Kingdom. \end{enumiii} \vspace{0.5cm} \noindent {\large \bf 15:45 -- 16:00 : Break} \vspace{0.5cm} \noindent {\large \bf 16:00 -- 17:45 : Session IV} \begin{enumiv} \item {\em Comparative Semantics of a Backtrackable Rendez-vous,} \\ \hspace*{4ex} Anton Eliens, Vrije Universiteit, The Netherlands. \item {\em Nonstandard Answers of Elementary Logic Programs,} \\ \hspace*{4ex} Paul Tarau, Universit\'{e} de Moncton, Canada, \\ \hspace*{4ex} Michel Boyer, Universit\'{e} de Montreal, Canada. \item {\em Some Algorithms for Fast and Complete Execution of Logic Programs,} \\ \hspace*{4ex} Roland Olsson, University of Molde, Norway. \item {\em Negation Expansion and Query Answering,} \\ \hspace*{4ex} Kanchana Kanchanasut, Peter Stuckey, University of Melbourne, Australia. \end{enumiv} \vspace{0.5cm} \noindent {\large \bf 18:00 : Shuttle to place Charles de Gaulle -- Etoile} \end{document}