[DL] Call for Participation ASPOCP 2012: 5th Workshop on Answer Set Programming and Other Computing Paradigms

aspocp at gmail.com aspocp at gmail.com
Fri Aug 10 16:20:23 CEST 2012


                            CALL FOR PARTICIPATION

                                 ASPOCP 2012

     5th Workshop on Answer Set Programming and Other Computing Paradigms


                             September 4th, 2012

    Collocated with the International Conference on Logic Programming 2012

                              Budapest, Hungary

                             September 4-8, 2012



 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.


 The program of ASPOCP 2012 features two invited talks and eleven accepted 
 technical paper presentations. It is available online at 



 Marc Denecker, Catholic University of Leuven, Belgium
 Wolfgang Faber, University of Calabria, Italy 


 M. Alviano and W. Faber. 
  Translating NP-SPEC into ASP
 E. Balai, M. Gelfond, and Y. Zhang. 
  SPARC -- Sorted ASP with Consistency Restoring Rules
 M. Balduccini and M. Gelfond. 
  Language ASP{f} with Arithmetic Expressions and Consistency-Restoring Rules 
 G. Charwat, J. Wallner, and S. Woltran. 
  Utilizing ASP for Generating and Visualizing Argumentation Frameworks 
 S. Chintabathina. 
  Planning and Scheduling in Hybrid Domains Using AnswerSet Programming 
 T. Eiter, M. Fink, T. Krennwallner, C. Redl, and P. Schüller. 
  Eliminating Unfounded Set Checking for HEX-Programs 
 J. Fichte and S. Szeider. 
  Backdoors to Normality for Disjunctive Logic Programs
 M. Gebser, T. Grote, R. Kaminski, P. Obermeier, O. Sabuncu, and T. Schaub. 
  Answer SetProgramming for Stream Reasoning 
 J. Lee and Y. Meng. 
  Two New Definitions of Stable Models with Generalized Quantifiers
 V. Lifschitz and F. Yang. 
  Lloyd-Topor Completion and General Stable Models
 J. Vennekens and M. Denecker. 
  Extending FO(ID) with Knowledge Producing Definitions: Preliminary Results 


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



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

More information about the dl mailing list