Answer Set Programming 2001: Stanford, CA, USA

Long presentations

• Michael Gelfond, Joel Galloway:
  Diagnosing Dynamic Systems in A Prolog.
  
• Joohyung Lee, Vladimir Lifschitz:
  Additive Fluents.
  
• Victor W. Marek, Jeffrey B. Remmel:
  On the Foundations of Answer Set Programming.
  
• Timo Soininen, Ilkka Niemelä, Juha Tiihonen, Reijo Sulonen:
  Representing Configuration Knowledge With Weight Constraint Rules.
  

Regular presentations

• Howard A. Blair:
  Dynamical Properties of Answer Set Programs.
  
• Stefania Costantini:
  Comparing different graph representations of logic programs under the Answer Set semantics.
  
• Deborah East, Miroslaw Truszczynski:
  More on Wire Routing with ASP.
  
• Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer:
  Computing Preferred and Weakly Preferred Answer Sets by Meta Interpretation in Answer Set Programming.
  
• Raphael A. Finkel, Victor W. Marek, Neil Moore, Miroslaw Truszczynski:
  Computing stable models in parallel.
  
• Keijo Heljanko, Ilkka Niemelä:
  Answer Set Programming and Bounded Model Checking.
  
• Le-Chi Tuan, Chitta Baral:
  Effect of knowledge representation on model based planning: experiments using logic programming encodings.
  
• Monica Nogueira, Marcello Balduccini, Michael Gelfond, Richard Watson, Matthew Barry:
  An A Prolog decision support system for the Space Shuttle.
  
• Mauricio Osorio, Juan Carlos Nieves, Chris Giannella:
  Useful Transformations in Answer set programming.
  
• Ramón P. Otero:
  Pertinence Logic Characterisation of Stable Models (Preliminary Report).
  
• David Pearce, Agustín Valverde:
  Abduction in equilibrium logic.
  
• Enrico Pontelli, Omar El-Khatib:
  Exploiting Vertical Parallelism from Answer Set Programs.
  
• Chiaki Sakama:
  Learning by Answer Sets.
  
• Torsten Schaub, Kewen Wang:
  A Comparative Study of Logic Programs with Preference: Preliminary Report.
  
• Tran Cao Son, Chitta Baral, Sheila A. McIlraith:
  Extending Answer Set Planning with Sequence, Conditional, Loop, Non-Deterministic Choice, and Procedure Constructs.
  
• Tran Cao Son, Jorge Lobo:
  Reasoning about Policies using Logic Programs.
  

Short presentations and posters

• Pedro Cabalar:
  Well Founded Semantics as Two dimensional Here and There.
  
• Pinar Koksal, Nihan Kesim Cicekli, Ismail Hakki Toroslu:
  Specification of Workflow Process Using the Action Description Language C.
  
• Marina De Vos, Dirk Vermeir:
  Logic Programming Agents and Game Theory.
  
• James D. Jones:
  Sets as Terms for Answer Set Programming.
  
• Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski:
  Tabular Constraint-Satisfaction Problems and Answer Set Programming.
  
• Alberto Bertoni, Giuliano Grossi, Alessandro Provetti, Vladik Kreinovich, Luis Tari:
  The Prospect for Answer Sets Computation by a Genetic Model.
  
• Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
  Genes and Ants for Default Logic.
  
• Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran:
  Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
  

Poster position papers

• Marc Denecker:
  On the Epistemological foundations of Logic Programming and its Extensions.
  
• Jay Halcomb, Adam Pease:
  On treating negation within XSB (and upon extending XSB programming with a form of logical negation, and its relations to existing varieties of logic programming).
  
• Aarati Parmar:
  A Declarative Implementation of Planning with Control.