[Om-announce] Call for Participation ASPOCP 2013: 6th Workshop on Answer Set Programming and Other Computing Paradigms

[aspocp at gmail.com]

Apologies for cross-posting.
 
===============================================================================

                            CALL FOR PARTICIPATION

                                 ASPOCP 2013

     6th Workshop on Answer Set Programming and Other Computing Paradigms

                 http://www.kr.tuwien.ac.at/events/aspocp2013

                              August 25th, 2013



    Collocated with the International Conference on Logic Programming 2013

                               Istanbul, Turkey

                              August 24-29, 2013

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


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 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), constraint satisfaction, and general means of external 
 computation.  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.


SCIENTIFIC PROGRAM

 The program of ASPOCP 2013 features twelve accepted technical paper 
 presentations. It is available online at 

 http://www.kr.tuwien.ac.at/events/aspocp2013/prog.html



ACCEPTED PAPERS

 M. Alviano and W. Faber. 
  Properties of Answer Set Programming with Convex Generalized Atoms
 M. Balduccini and Y. Lierler
  Hybrid Automated Reasoning Tools: from Black-box to Clear-box Integration
 M. Banbara, M. Gebser, K. Inoue, T. Schaub, T. Soh, N. Tamura, and M. Weise
  Aspartame: Solving Constraint Satisfaction Problems with Answer Set 
  Programming
 M. Bartholomew and J. Lee
  A Functional View of Strong Negation in Answer Set Programming
 P. Cabalar and J. Fandinno
  An Algebra of Causal Chains
 V.K. Chaudhri, S. Heymans, M. Wessel, and T.C. Son
  Query Answering in Object Oriented Knowledge Bases in Logic Programming:
  Description and Challenge for ASP
 S. Ellmauthaler and H. Strass
  The DIAMOND System for Argumentation: Preliminary Report
 M. Gebser, P. Obermeier, and T. Schaub
  A System for Interactive Query Answering with Answer Set Programming
 C. Gunicen, E. Erdem, and H. Yenigun
  Generating Shortest Synchronizing Sequences using Answer Set Programming
 A. Harrison, V. Lifschitz, and F. Yang
  On the Semantics of Gringo
 Y. Lierler and M. Truszczynski
  Abstract Modular Systems and Solvers
 J. Vennekens
  Negation in the Head of CP-logic Rules


REGISTRATION AND LOCAL ARRANGEMENTS

 Registration is operated by the ICLP 2013 organization. For corresponding 
 information, as well as for travel and accommodation details consult:

 http://www.iclp2013.org


WORKSHOP CO-CHAIRS

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