Important Dates
Call for Papers
Program Committee
Invited Talks
Paper Submission
Accepted Papers
Author Instructions
Travel Information

Accepted Papers (sorted by title)

The proceedings are available electronically via the Springer LINK Information Service.

Regular Papers:

A Comparative Study of Well-founded Semantics for Disjunctive Logic Programs
Kewen Wang

Algorithms for computing X-minimal models
Chen Avin, Rachel ben-Eliyahu - Zohary

Antitonic Logic Programs
Carlos Viegas Damásio, Luís Moniz Pereira

Bounded LTL Model Checking with Stable Models
Keijo Heljanko, Ilkka Niemelä

Declarative specification and solution of combinatorial auctions using logic programming
Chitta Baral, Cenk Uyan

Diagnosing physical systems in A-Prolog
Michael Gelfond, Joel Galloway

E-RES: Reasoning about Actions, Events and Observations
A. Kakas, R. Miller, F. Toni

Encoding solutions of the frame problem in dynamic logic
Norman Foo, Dongmo Zhang, Yan Zhang, Samir Chopra, Bao Quoc Vo

Explicitly using default knowledge in concept learning: an extended Description Logics plus strict and default rules
Veronique Ventos, Pierre Brezellec, Henry Soldano

Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
Thomas Lukasiewicz

Improving ASP Instantiators by Join-Ordering Methods
Nicola Leone, Simona Perri, Francesco Scarcello

Multi-Adjoint Logic Programming with Continuous Semantics
Jesus Medina, Manuel Ojeda Aciego, Peter Vojtas

Multi-dimensional Dynamic Knowledge Representation
João Alexandre Leite, José Julio Alferes, Luís Moniz Pereira

New Generation Systems for Non Monotonic Reasonning
Pascal Nicolas, Frederic Saubion, Igor Stephan

Omega-Restricted Logic Programs
Tommi Syrjänen

On the Effect of Default Negation on the Expressiveness of Disjunctive Rules
Tomi Janhunen

On the Expressibility of Stable Logic Programming
V.W. Marek, J.B. Remmel

On the Relationship Between Defeasible Logic and Well-Founded Semantics
Gerhard Brewka

Optimizing the Computation of Heuristics for Answer Set Programming Systems
Wolfgang Faber, Nicola Leone, Gerald Pfeifer

Planning with domain-dependent knowledge of different kinds -- an answer set programming approach
Tran Cao Son, Chitta Baral, Sheila McIlraith

Reasoning with open logic programs
P.A. Bonatti

Representation of Incomplete Knowledge by Induction of Default Theories
Pascal NICOLAS, Béatrice DUVAL

Strong Equivalence for Logic Programs and Default Theories (Made Easy)
Hudson Turner

System Demo Papers:

A-System: Programming with Abduction
Antonis Kakas, Bert Van Nuffelen

An Update Front-End for Extended Logic Programs
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits

aspps -- an implementation of answer-set programming with propositional schemata
Deborah East, Miroslaw Truszczynski

NoMoRe: A system for Non-Monotonic Reasoning under Answer Set Semantics (Abstract)
Christian Anger, Kathrin Konczak, Thomas Linke

plp: A Generic Compiler for Ordered Logic Programs
James P. Delgrande, Torsten Schaub, Hans Tompits

Prototypes for NMR with infinite stable models and function symbols
P.A. Bonatti

psmodels: Stable Models based on Pertinence
Ramón P. Otero

System Description: DLV
Tina Dell'Armi, Giuseppe Ielpa, Wolfgang Faber, Nicola Leone, Simona Perri, Gerald Pfeifer

System Description: The DLV^K Planning System
Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres

The Smodels System
Tommi Syrjänen, Ilkka Niemelä

The USA-Advisor: A Case Study in Answer Set Planning
Marcello Balduccini, Michael Gelfond, Richard Watson, Monica Nogueira