ASP'05
Answer Set Programming:
Advances in Theory and Implementation

• Theory:
  A Preliminary Report on Integrating of Answer Set and Constraint Solving
  Sabrina Baselice (Univ. "Federico II", Italy), Piero Bonatti (Univ. "Federico II", Italy), Michael Gelfond (Texas Tech University, USA).

• Implementation:
  

  Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
  Hans Tompits (Technische Universit�t Wien, Austria), Stefan Woltran (Technische Universit�t Wien, Austria).

• Applications:
  

  SELP - A System for Studying Strong Equivalence between Logic Programs
  Yin Chen ( South China Normal University, China and Sun Yat-sen University, China), Fangzhen Lin (Hong Kong University of Science and Technology) and Lei Li (Sun Yat-sen University, China).

• Poster:
  

  An Algebraic Account of Modularity in ID-logic
  Joost Vennekens (K.U.Leuven, Belgium), Marc Denecker (K.U.Leuven, Belgium).

What is a Logic Program
Vladimir Lifschitz (Univ. of Texas at Austin, USA)

Innovative Applications of ASP
Moderated by Gerhard Brewka (Univ. of Leipzig, Germany)

Building an Open Knowledge Library
Moderated by Chitta Baral (Arizona State University, USA)

A Preliminary Report on Integrating of Answer Set and Constraint Solving
Sabrina Baselice (Univ. "Federico II", Italy), Piero Bonatti (Univ. "Federico II", Italy), Michael Gelfond (Texas Tech University, USA).

Extending Conceptual Logic Programs with Arbitrary Rules
Stijn Heymans (Vrije Universiteit Brussel, Belgium), Davy Van Nieuwenborgh (Vrije Universiteit Brussel, Belgium) Dirk Vermeir (Vrije Universiteit Brussel, Belgium).

Combining Answer Sets of Nonmonotonic Logic Programs
Chiaki Sakama (Wakayama University, Japan), Katsumi Inoue (National Institute of Informatics, Japan).

An Algebraic Account of Modularity in ID-logic
Joost Vennekens (K.U.Leuven, Belgium), Marc Denecker (K.U.Leuven, Belgium).

Nelson's Strong Negation, Safe Beliefs and the Answer Set Semantics
Magdalena Ortiz (Universidad de las Americas, Mexico), Mauricio Osorio (Universidad de las Americas, Mexico).

Disjunctive Answer Set Programming via Satisfiability
Yuliya Lierler (Erlangen-N�rnberg Universit�t, Germany).

Reducing Propositional Theories in Equilibrium Logic to Logic Programs
Pedro Cabalar (Corunna University), David Pearce (Universidad Rey Juan Carlos), Agust�n Valverde (Malaga University).

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Hans Tompits (Technische Universit�t Wien, Austria), Stefan Woltran (Technische Universit�t Wien, Austria).

SELP - A System for Studying Strong Equivalence between Logic Programs
Yin Chen ( South China Normal University, China and Sun Yat-sen University, China), Fangzhen Lin (Hong Kong University of Science and Technology) and Lei Li (Sun Yat-sen University, China).

Debugging Logic Programs under the Answer Set Semantics
Martin Brain (University of Bath, UK), Marina De Vos (University of Bath, UK).

A New Algorithm for Answer Set Computation
Giuliano Grossi (Universit� degli Studi di Milano, Italy), Massimo Marchi (Universit� degli Studi di Milano, Italy).

The nomore++ Approach to Answer Set Solving
Christian Anger (Universit�t Potsdam, Germany), Martin Gebser (Universit�t Potsdam, Germany), Thomas Linke (Universit�t Potsdam, Germany), André Neumann (Universit�t Potsdam, Germany), Torsten Schaub (Universit�t Potsdam, Germany).

An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Enrico Giunchiglia (University of Genova, Italy), Marco Maratea (University of Genova, Italy).

An Interactive Approach to Answer Set Programming
Martin Brain (University of Bath, UK), Richard Watson (Texas Tech University, USA), Marina De Vos (University of Bath, UK).

Possibilistic Stable Model Computing
Pascal Nicolas (University of Angers, France), Claire Lef�vre (University of Angers, France).

A Backjumping Technique for Disjunctive Logic Programs
Wolfgang Faber (Univeristy of Calabria, Italy), Nicola Leone (University of Calabria, Italy), Francesco Ricca (Univeristy of Calabria, Italy).

Intelligence Analysis Using Quantitative Preferences
Davy Van Nieuwenborgh (Vrije Universiteit Brussel, Belgium), Stijn Heymans (Vrije Universiteit Brussel, Belgium), Dirk Vermeir (Vrije Universiteit Brussel, Belgium).

Exploiting ASP for Semantic Information Extraction
Massimo Ruffolo (Exeura, Italy and ICAR-CNR, Italy), Nicola Leone (Exeura, Italy and University of Calabria, Italy), Marco Manna (ICAR-CNR, Italy) Domenico Sacc� (ICAR-CNR, Italy and ICAR-CNR, Italy and University of Calabria, Italy) Amedeo Zavatto (ICAR-CNR, Italy).

Abduction and Preferences in Linguistics
Kathrin Konczak (Universit�t Potsdam, Germany), Ralf Vogel (Universit�t Potsdam, Germany).

A Language for Modular Answer Set Programming: Application to ACC Tournament Scheduling
Luis Tari (Arizona State University, USA), Chitta Baral (Arizona State University, USA), Saadat Anwar (Arizona State University, USA).

Specification of Assessment-test Criteria through ASP Specifications
Giovambattista Ianni (Universit`a della Calabria, Italy), Claudio Panetta (Universit� della Calabria, Italy), Francesco Ricca (Universit� della Calabria, Italy).

Modeling Hybrid Domains Using Process Description Language
Sandeep Chintabathina (Texas Tech University, USA), Michael Gelfond (Texas Tech University, USA), Richard Watson (Texas Tech University, USA).

Applications of Preferences using Answer Set Programming
Claudia Zepeda (Universidad de las Americas, Mexico and Universit� Lyon 1 and INSA de Lyon, France) , Mauricio Osorio (Universidad de las Americas, Mexico), Juan Carlos Nieves (Universidad de las Americas, Mexico), Christine Solnon (Universit� Lyon 1 and INSA de Lyon, France), David Sol (Universidad de las Americas, Mexico).