CfP ASPOCP 2012: 5th Workshop on Answer Set Programming and Other Computing Paradigms

[Michael Fink]

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

                                CALL FOR PAPERS

                                  ASPOCP 2012

      5th Workshop on Answer Set Programming and Other Computing Paradigms

                     http://sites.google.com/site/aspocp12

                              September 4th, 2012



     Collocated with the International Conference on Logic Programming 2012

                               Budapest, Hungary

                              September 4-8, 2012

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


AIMS AND SCOPE

  Since its introduction in the late 1980s, 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 which is currently extended towards
  satisfiability modulo theories (SMT), the relationship of ASP to other
  computing paradigms, such as constraint satisfaction, quantified
  boolean formulas (QBF), first-order logic (FOL), or FO(ID) logic 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, FOL
  theorem provers, and CLP systems.

  Furthermore, the practical applications of ASP also foster 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 theory, solving, and applications , in combination with
  or inspired by other computing paradigms.


TOPICS

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

  - ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL).
  - ASP and constraint programming.
  - ASP and other logic programming paradigms, e.g., FO(ID).
  - ASP and other nonmonotonic languages, e.g., action languages.
  - ASP and probabilistic reasoning.
  - ASP and machine learning.
  - New methods of computing answer sets using algorithms or systems of
    other paradigms.
  - Language extensions to ASP.
  - ASP and multi-agent systems.
  - ASP and multi-context systems.
  - Modularity and ASP.
  - ASP and argumentation.
  - Multi-paradigm problem solving involving ASP.
  - Evaluation and comparison of ASP to other paradigms.
  - ASP and related paradigms in 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=aspocp12


IMPORTANT DATES

  Submission deadline:        June 19, 2012
  Notification:               July 19, 2012
  Camera-ready articles due:  July 29, 2012
  Workshop:                   September 4, 2012


PROCEEDINGS

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


LOCATION

  The workshop will be held in Budapest, Hungary, collocated with
  the International Conference on Logic Programming (ICLP) 2012.


WORKSHOP CO-CHAIRS

  Michael Fink, Vienna University of Technology, Austria
  Yuliya Lierler, University of Kentucky, USA


PROGRAM COMMITTEE

  Marcello Balduccini, Kodak Research Labs, USA
  Gerhard Brewka, University of Leipzig, Germany
  Pedro Cabalar, Corunna University, Spain
  Sandeep Chintabathina, University of Arkansas at Pine Bluff, USA
  Wolfgang Faber, University of Calabria, Italy
  Martin Gebser, University of Potsdam, Germany
  Giovambattista Ianni, University of Calabria, Italy
  Joohyung Lee, Arizona State University, USA
  Joao Leite, New University of Lisbon, Portugal,
  Vladimir Lifschitz, University of Texas at Austin, USA
  Marco Maratea, University of Genoa, Italy
  Alessandro Mosca, Free University of Bolzano, Italy
  Emilia Oikarinen, Aalto University, Finland
  David Pearce, Universidad Politecnica de Madrid, Spain
  Axel Polleres, Siemens AG Corporate Technology, Austria
  Peter Schueller, Vienna University of Technology, Austria
  Guillermo R. Simari, Universidad Nacional del Sur, Argentina
  Tran Cao Son, New Mexico State University, USA
  Miroslaw Truszczynski, University of Kentucky, USA
  Joost Vennekens, Catholic University of Leuven, Belgium
  Stefan Woltran, Vienna University of Technology, Austria
  Fangkai Yang, University of Texas at Austin, USA
  Jia-Huai You, University of Alberta, Canada