Answer Set Programming 2001

Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning

AAAI Spring 2001 Symposium
Stanford, March 26-28 2001
Organizers: Alessandro Provetti and Son Tran Cao.

Invited Speakers (tbc): Bart Selman.

Call for papers (deadline passed)
List of accepted papers
Tentative schedule
Click here to download a tared/ziped file containing all the papers which will be presented in the symposium.

Accepted papers

Long presentations

Diagnosing Dynamic Systems in AProlog (Michael Gelfond and Joel Galloway)
Additive Fluents (Joohyung Lee and Vladimir Lifschitz)
On the Foundations of Answer Set Programming (V.W.Marek and J.B.Remmel)
Representing Configuration Knowledge With Weight Constraint Rules (Timo Soininen, Ilkka Niemela, Juha Tiihonen, and Reijo Sulonen)

Regular presentations

Dynamical Properties of Answer Set Programs (Howard A. Blair)
Comparing different graph representations of logic programs under the Answer Set semantics (Stefania Costantini)
More on Wire Routing with ASP (Deborah East and Miroslaw Truszczynski)
Computing Preferred and Weakly Preferred Answer Sets by MetaInterpretation in Answer Set Programming (Thomas Eiter, Wolfgang Faber, Nicola Leone, and Gerald Pfeifer)
Transitive Closure, Answer Sets and Predicate Completion (Esra Erdem and Vladimir Lifschitz)
Computing stable models in parallel (R.A. Finkel, V.W. Marek, N. Moore and M. Truszczynski)
Answer Set Programming and Bounded Model Checking (Keijo Heljanko and Ilkka Niemela)
Effect of knowledge representation on model based planning: experiments using logic programming encodings (Lechi Tuan and Chitta Baral)
An AProlog decision support system for the Space Shuttle (M. Nogueira, M. Balduccini, M. Gelfond, R. Watson, and M. Barry)
Useful Transformations in Answer set programming (M. Osorio, J. C. Nieves, and C. Giannella)
Pertinence Logic Characterisation of Stable Models (Preliminary Report) (Ramon P. Otero)
Abduction in equilibrium logic (David Pearce and Augustin Valverde)
Exploiting Vertical Parallelism from Answer Set Programs (Abstract) (Enrico Pontelli and Omar ElKhatib)
Learning by Answer Sets (Chiaki Sakama)
A Comparative Study of Logic Programs with Preference: Preliminary Report (Torsten Schaub and Kewen Wang)
Extending Answer Set Planning with Sequence, Conditional, Loop, Non-Deterministic Choice, and Procedure Constructs (Tran Cao Son, Chitta Baral, and Sheila McIlraith)
Reasoning about Policies using Logic Programs (Tran Cao Son and Jorge Lobo)

Short presentations and posters

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

Poster position papers

On the Epistemological foundations of Logic Programming and its Extensions (Marc Denecker)
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) (Jay Halcomb and Adam Pease) - Get the file in MS Word format.
A Declarative Implementation of Planning with Control (Aarati Parmar)