[Om-announce] ASPOCP deadline extended

Thu Apr 19 20:46:32 CEST 2018

[Apologies for multiple postings.]

We would like to inform that we have decided to extend ASPOCP 2018 deadlines for submissions as follows:

Abstract submission deadline (EXTENDED): April 20, 2018
Paper submission deadline (EXTENDED): April 22, 2018
Author notification: May 15, 2018
Camera-ready paper due: May 27, 2018

We also recall that ASPOCP proceedings are informal and authors are allowed to present their work elsewere.

Best regards,
Jorge Fandinno and Johannes Fichte

=============================================================================== 
                               CALL FOR PAPERS                                  
                                 ASPOCP 2018                                   
     11th Workshop on Answer Set Programming and Other Computing Paradigms      
                    https://sites.google.com/site/aspocp2018                 
                              July 18, 2018 (Post-FLoC workshop)

   Affiliated with the 35th International Conference on Logic Programming (ICLP)
as part of the Federated Logic Conference 2018
                                Oxford, UK                                  
                             July 14 - 17, 2018                                 

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

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 led to a new method of computing answer sets using SAT              
 solvers and techniques adapted from SAT. This has been a much                  
 studied relationship, and is currently extended towards                        
 satisfiability modulo theories (SMT). The relationship of ASP to other         
 computing paradigms, such as constraint satisfaction, quantified               
 Boolean formulas (QBF), Constraint Logic Programming (CLP),                    
 first-order logic (FOL), and FO(ID) is also the subject of active              
 research. Consequently, new methods of computing answer sets are being         
 developed based on relationships to these formalisms.                        

 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 (which recently led to               
 the Constraint Answer Set Programming (CASP) research direction).            

 A large body of general results regarding ASP is available and                 
 several efficient ASP solvers have been implemented. However, there            
 are still significant challenges in applying ASP to real life                  
 applications, and more interest in relating ASP to other computing             
 paradigms is emerging. This workshop will provide opportunities for            
 researchers to identify these challenges and to exchange ideas for             
 overcoming them.                       

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 external means of computation.                                       
 - ASP and probabilistic reasoning.                                             
 - ASP and knowledge compilation.                                               
 - 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 13 pages (excluding
 references).

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

 The submission format is TPLP (Style).

PROCEEDINGS                                                                     

 Accepted papers will be made available online as inofficial proceedings with 
 CEUR proceedings. The best paper will receive an invitation to the Journal on 
 Theory and Practice of Logic Programming (TPLP) as fast track paper. 

 A selection of extended and revised versions of accepted papers will appear 
 in a special issue. We are currently negotiating with potential journals.
 Such papers will go through a second formal selection process to meet
 the high quality standard of the journal.     

LOCATION
 For details see: http://www.floc2018.org/local-information/                                                                        
 The workshop will be held in Oxford, UK, co-located with                  
 the 35th International Conference on Logic Programming (ICLP) as
 as part of the Federated Logic Conference 2018.                      

WORKSHOP CO-CHAIRS
 Jorge Fandinno, IRIT, Toulouse, France
 Johannes K. Fichte, TU Wien, Austria                                                              

PROGRAM COMMITTEE
Mario Alviano Department of Mathematics and Computer Science, University of Calabria  
Marcello  Balduccini  Saint Joseph's University 
Mutsunori Banbara Information Science and Technology Center, Kobe University, JAPAN 
Bart  Bogaerts  Katholieke Universiteit Leuven  
Pedro Cabalar University of Corunna 
Stefania  Costantini  Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica, Univ. dell'Aquila  
Marc  Denecker  Katholieke Universiteit Leuven  
Carmine Dodaro  University of Genova  
Esra  Erdem Sabanci University  
Wolfgang  Faber University of Huddersfield  
Jorge Fandiño University of Toulouse IRIT/CNRS, Toulouse, France  chair
Johannes K. Fichte  TU Wien chair
Michael Gelfond Texas Tech University 
Enrico  Giunchiglia DIST - Univ. Genova 
Amelia  Harrison  The University of Texas at Austin 
Daniela Inclezan  Miami University  
Tomi  Janhunen  Aalto University  
Nicola  Leone Department of Mathematics and Computer Science - University of Calabria 
Yuliya  Lierler University of Nebraska at Omaha 
Vladimir  Lifschitz The University of Texas at Austin 
Marco Maratea DIBRIS, University of Genova  
Emilia  Oikarinen Finnish Institute of Occupational Health  
Max Ostrowski University of Potsdam 
Axel  Polleres  Vienna University of Economics and Business - WU Wien 
Francesco Ricca Department of Mathematics and Computer Science University of Calabria 
Javier  Romero  Universität Potsdam 
Orkunt  Sabuncu TED University, Ankara  
Peter Schüller  Marmara University  
Claudia Schulz  TU Darmstadt  
Mirek Truszczynski  Computer Science Department, University of Kentucky 
Concepcion  Vidal University of Coruña  
Antonius  Weinzierl Aalto University  
Stefan  Woltran TU Wien 
Jia-Huai  You University of Alberta 