[ecoop-info] ASPOCP 2011 Call For Papers

[aspocp11 at easychair.org]

===============================================================================

                               CALL FOR PAPERS

                                 ASPOCP 2011

     4th Workshop on Answer Set Programming and Other Computing Paradigms

                 http://www.dbai.tuwien.ac.at/proj/aspocp11/

                                 July 10, 2011



    Collocated with the International Conference on Logic Programming 2011

                           Lexington, Kentucky, USA

                                July 6-10, 2011

===============================================================================


AIMS AND SCOPE

 Since its introduction in the 1990s, answer set programming (ASP) has
 been widely applied to various knowledge-intensive tasks and
 combinatorial search problems. ASP was found to be closely related to
 SAT, which has led to a new method of computing answer sets using SAT
 solvers and techniques adapted from SAT. While this has been the most
 studied relationship, the relationship of ASP to other computing
 paradigms, such as constraint satisfaction, quantified Boolean
 formulas (QBF), or first-order logic (FOL) is also the subject of
 active research. New methods of computing answer sets are being
 developed based on the relation between ASP and other paradigms, such
 as the use of pseudo-Boolean solvers, QBF solvers, and FOL theorem
 provers. Furthermore, the practical application of ASP also fosters
 work on multi-paradigm problem-solving, and in particular language
 and solver integration. The most prominent examples in this area
 currently are the integration of ASP with description logics (in the
 realm of the Semantic Web) and constraint satisfaction.  This
 workshop will facilitate the discussion about crossing the boundaries
 of current ASP techniques, in combination with or inspired by other
 computing paradigms.


TOPICS

 Topics of interests include (but are not limited to):

 - Relating ASP to classical logic formalisms (SAT/FOL/QBF/SMT/DL).
 - Relating ASP to constraint programming.
 - Relating ASP to other logic programming paradigms.
 - Relating ASP to other nonmonotonic languages.
 - New methods of computing answer sets using algorithms or systems of
   other paradigms.
 - ASP and probabilistic reasoning.
 - ASP and machine learning.
 - Language extensions to ASP.
 - ASP and argumentation.
 - ASP and multi-agent systems.
 - Multi-paradigm problem solving involving ASP.
 - Evaluation and comparison of ASP to other paradigms.
 - Embedding ASP for challenging applications.
 - Hybridizing ASP with procedural approaches.
 - Enhanced grounding or beyond grounding.


SUBMISSIONS

 Papers must describe original research and should not exceed 15 pages
 in the Springer LNCS format <URL:http://www.springeronline.com/lncs/>.

 Paper submission will be handled electronically by means of the
 Easychair system. The submission page is available at

  http://www.easychair.org/conferences/?conf=aspocp11


IMPORTANT DATES

 Submission deadline:        April 22, 2011
 Notification:               May 13, 2011
 Camera-ready articles due:  May 27, 2011
 Workshop:                   July 10, 2011


PROCEEDINGS

 The workshop contributions will be published electronically, using
 the Computing Research Repository (CoRR).


LOCATION

 The workshop will be held in Lexington, Kentucky, USA, collocated
 with the International Conference on Logic Programming (ICLP) 2011.


WORKSHOP CO-CHAIRS

 Marcello Balduccini   (Kodak Research Labs, USA)
 Stefan Woltran        (Vienna University of Technology, Austria)


PROGRAM COMMITTEE

Gerhard Brewka, University of Leipzig, Germany
Pedro Cabalar, Corunna University, Spain
Sandeep Chintabathina, Texas Tech University, USA
Wolfgang Faber, University of Calabria, Italy 
Michael Fink, Vienna University of Technology, Austria 
Martin Gebser, University of Potsdam, Germany 
Joohyung Lee, Arizona State University, USA 
Joao Leite, New University of Lisbon, Portugal,
Yuliya Lierler, University of Kentucky, USA
Vladimir Lifschitz, University of Texas at Austin, USA 
Marco Maratea, University of Genoa, Italy
Emilia Oikarinen, Aalto University, Finland 
Axel Polleres, DERI, National University of Ireland, Ireland
Guillermo R. Simari, Universidad Nacional del Sur, Argentina 
Miroslaw Truszczynski, University of Kentucky, USA 
Jia-Huai You, University of Alberta, Canada