Date: 18-May-2012 Title: EasyChair Proceedings in Computing (EPiC) goes live Hits: 4 Contributed by: Daniel Le Berre Keywords: General Interest         From EPiC website: The EasyChair Proceedings in Computing (EPiC) series provides fast and flexible publication of proceedings and collections of material in the broad discipline of computing. Publication provides both online access and on-demand production of hardcopy. EPiC is integrated with the EasyChair reviewing system, thus providing a seamless process of submission-to-publication of reviewed content. All material is formatted using the EasyChair LaTeX class file, to ensure a consistent easy to read presentation. The first available volumes correspond mainly to FLoC 2010 workshops (including the first edition of Pragmatics of SAT).

Date: 17-May-2012 Title: ASPCOMP 2013: 4th OPEN Answer Set Programming Competition: Call for Benchmark Problems Hits: 8 Contributed by: Anonymous Keywords: Logic         ........................................................................ 4th OPEN Answer Set Programming Competition 2013 Call for Benchmark Problems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ ........................................................................ The 4th Open Answer Set Programming Competition is open to ASP systems and *any other system* based on a declarative specification paradigm. The event is currently open and in the Call for Benchmarks stage. == Call for Benchmark Problems == Participants will compete on a selected collection of declarative specifications of benchmark problems, taken from a variety of domains as well as real world applications, and instances thereof. These include, but are not limited to: - Deductive database tasks on large data-sets - Sequential and Temporal Planning - Classic and Applicative graph problems - Puzzles and Combinatorics - Scheduling, Timetabling, and other resource allocation problems - Combinatorial Optimization Problems - Ontology reasoning - Automated Theorem Proving and Model Checking - Reasoning tasks over large propositional instances - Constraint Programming problems - Other AI problems We encourage to provide help by proposing and/or devising new challenging benchmark problems. The submission of problems arising from applications of practical impact are strongly encouraged; problems used in the former ASP Competitions, or variants thereof, can be re-submitted. Benchmark authors are expected to produce a problem specification and an instance set (or a generator thereof). The detailed benchmark problems submission procedure is available at: http://www.mat.unical.it/aspcomp2013/BenchmarkSubmission === About the ASP Competition Series === Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modelling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. Since the first informal editions (Dagstuhl 2002 and 2005), ASP systems compare themselves in the nowadays customary ASP Competition: the 4th ASP Competition will be run jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria), in the first half of 2013. The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. The ASP competition is held as an open tournament. The "Model & Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. == Important Dates == * Problem selection stage Problem submission deadline: Aug 31th, 2012 * Competition stage "Model & Solve" submission deadline: Mar 1st, 2013 "System" submission deadline: Mar 1st, 2013 * Sep 15-19th, 2013 Announcement of results and awards at LPNMR 2013 - Corunna, Spain For further information please visit the competition web site http://aspcomp2013.mat.unical.it/ or contact us by email: aspcomp2013@kr.tuwien.ac.at.

Date: 16-May-2012 Title: Logic and Search (LaSh 2012) final call for papers Hits: 3 Contributed by: Tomi Janhunen Keywords:         LaSh 2012, the 4th International Workshop on Logic and Search will be organized as an ECAI 2012 workshop in Montpellier, France, on the 27th of August, 2012. The workshop fosters the exchange and development of ideas in both theory and practice of logic-based methods for combinatorial problem solving. LaSh features three invited talks by Peter Baumgartner, Leonardo de Moura, and Konstantin Korovin. The event is an occasion to discuss specific technical problems, formulate challenges and opportunities, compare and contrast techniques of different groups, and examine possible synergies and integrations. Please consult http://logicandsearch.org/LaSh2012 for details and the list of topics of interest. The deadline for paper submission is the 28th of May 2012.

Date: 16-May-2012 Title: Seven Challenges in Parallel SAT Solving, by Yousef Hamadi and Christoph M. Wintersteiger (to be presented at AAAI 2012) Hits: 86 Contributed by: Daniel Le Berre Keywords: null         This paper provides a broad overview of the situation in the area of Parallel Search with a specific focus on Parallel SAT Solving. A set of challenges to researchers is presented which, we believe, must be met to ensure the practical appli- cability of Parallel SAT Solvers in the future. All these chal- lenges are described informally, but put into perspective with related research results, and a (subjective) grading of diffi- culty for each of them is provided.

Date: 07-May-2012 Title: SAT 2012 early registration opened until May 24 Hits: 53 Contributed by: Daniel Le Berre Keywords: General Interest         The registration for SAT 2012 in Trento is now open. Early registration lasts until May 24. The list of accepted papers is also available.

Date: 07-May-2012 Title: PDMC 2012 Call for Papers Hits: 33 Contributed by: Keijo Heljanko Keywords: Verification, SAT application, SAT tools, Distributed Computing, call for papers, conference information, SAT-solver, null, null, null         Call for Papers - PDMC 2012 ============================================================================== 11th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2012) September 17th, 2012, Imperial College London, London, UK Co-locating with 9th International Conference on Quantitative Evaluation of SysTems (QEST) 2012 http://www.pdmc.cz/PDMC12 ============================================================================== Abstract submission: May 25, 2012 Full paper submission: June 1, 2012 Notification: July 9, 2012 Workshop: September 17, 2012 Post-proceedings version: October 19, 2012 GOALS AND SCOPE: ---------------- The aim of the PDMC workshop series is to cover all aspects related to the verification and analysis of very large and complex systems, in particular in using methods and techniques that exploit current hardware architectures. The PDMC workshop aims to provide a working forum for presenting, sharing, and discussing recent achievements in the field of high-performance verification. TOPICS OF INTEREST: ------------------- Topics of interest include, but are not limited to: * parallel and/or distributed-memory techniques for verification * parallel SAT solving and its applications in verification * I/O efficient algorithms for verification * GPU accelerated algorithms for verification * platform dependent verification tools * industrial case studies employing PDMC techniques * applications of PDMC techniques to systems biology SUBMISSIONS: ------------ All submissions must be original and unpublished. Regular and tool papers accepted for the presentation at the workshop will appear in Electronic Proceedings in Theoretical Computer Science series, hence, submissions must be prepared in LaTeX using the EPTCS macro package. Submission accepted for the presentation must be presented at the workshop conference by at least one of the authors. Submissions are processed through the EasyChair conference system. We accept * regular papers (max. 15 pages in EPTCS style), * tool papers (max. 5 pages in EPTCS style), PROGRAMME COMMITTEE: -------------------- * Keijo Heljanko (Aalto University, Finland) - co-chair * William J. Knottenbelt (Imperial College London, UK) - co-chair * Henri E. Bal (Vrije University Amsterdam, Netherlands) * Jiri Barnat (Masaryk University, Czech Republic) * Dragan Bosnacki (Eindhoven University of Technology, Netherlands) * Lubos Brim (Masaryk University, Czech Republic) * Gianfranco Ciardo (University of California at Riverside, US) * Stefan Edelkamp (University of Bremen, Germany) * John Erickson (Intel, USA) * Youssef Hamadi (Microsoft Research, UK) * Gerard Holzmann (NASA/JPL, USA) * Gerald Luettgen (University of Bamberg, Germany) * Wendelin Serwe (INRIA/LIG, France) * Gethin Norman (University of Glasgow, UK) * Jaco van de Pol (University of Twente, Netherlands) * Rong Zhou (Palo Alto Research Center, USA)

Date: 25-Apr-2012 Title: Reminder: Early Registration for CPAIOR 2012 Hits: 57 Contributed by: Thierry Petit Keywords: Alternative approach, CSP, Linear Programming, variable ordering heuristic, General Interest, conference information, Constraint Programming, SAT/CP         ================================= CPAIOR 2012 - REMINDER Early Registration ends on May 2, 2012 ================================= CPAIOR 2012 - Ninth International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming May 28 - June 1, 2012, Cité des Congrès, Nantes web: http://www.emn.fr/z-info/cpaior-2012/ This year, CPAIOR will feature 26 presentations of papers and three invited talks from: - Michel Habib, Université de Paris Diderot, France - Helmut Simonis, 4C, Ireland - Laurence Wolsey, Université Catholique de Louvain, Belgium The conférence is preceded by a number of satellite events: - A one-day Master Class on Scheduling, - A one-day Wokshop session : - Combinatorial Optimization in Logistics and Production Systems Chairs : E. Pinson and J. E. Mendoza - First International Workshop on Search Strategies and Non-standard Objectives (SSNOWorkshop'12) Chairs : C. Artigues, E. Hebrard, M.-J. Huguet, D. Mehta - Fourth International Workshop on Bin Packing and Placement Constraints (BPPC'12) Chairs : N. Beldiceanu and F. Fages

Date: 25-Apr-2012 Title: Call for Papers: Pragmatics of SAT workshop @ SAT 2012, Trento, Italy, June 16, 2012 Hits: 39 Contributed by: Daniel Le Berre Keywords: General Interest         Due to several requests, we decided to extend the deadline for submitting papers to PoS to April 30, 2012. We also allow the submission of papers for which an abstract has not been submitted yet. In this case, please submit your abstract ASAP.

Date: 24-Apr-2012 Title: Logic and Search (LaSh 2012) second call for papers Hits: 39 Contributed by: Tomi Janhunen Keywords: null         LaSh 2012, the 4th International Workshop on Logic and Search will be organized as an ECAI 2012 workshop in Montpellier, France, on the 27th of August, 2012. The workshop fosters the exchange and development of ideas in both theory and practice of logic-based methods for combinatorial problem solving. LaSh is an occasion to discuss specific technical problems, formulate challenges and opportunities, compare and contrast techniques of different groups, and examine possible synergies and integrations. Please consult http://logicandsearch.org/LaSh2012 for details, invited speakers, and the list of topics of interest. The deadline for paper submission is the 28th of May 2012.

Date: 23-Apr-2012 Title: Reminder: SAT'12 workshop CSPSAT'12: deadline is TODAY (Monday, April 23) Hits: 34 Contributed by: Yael Ben-Haim Keywords: CSP         Deadline to CSPSAT'12 is TODAY (Monday, April 23). Second International Workshop on the Cross-Fertilization Between CSP and SAT (CSPSAT'12) in conjunction with SAT 2012 Trento, Italy June 16, 2012 http://sysrun.haifa.il.ibm.com/hrl/cspsat2012/ Overview and Scope ------------------ Constraint Satisfaction Problems (CSP’s) and Boolean Satisfiability Problems (SAT) have much in common. However, they also differ in many important aspects, which result in major differences in solution techniques. More importantly, the CSP and SAT communities, while to some extent interacting with each other, are mostly separate communities with separate conferences and meetings. This workshop is designed as a venue for bridging the gap and for cross- fertilization between the two communities, in terms of ideas, problems, techniques, benchmarks, and results. The structure of the workshop will include an invited talk, a set of contributed talks, and free time for interaction between speakers and participants, thus allowing for further transfer of ideas between the two communities. The workshop is the second in the series of annual workshops, following a successful first occasion at SAT'11. A related workshop took place at CP’06: “Workshop on the Integration of SAT and CP techniques”. Topics in the scope of the workshop include: * Adaptation of CSP techniques to SAT problems * Adaptation of SAT techniques to CSP’s * Efficient translations and encodings from one framework to the other * Heterogeneous CSP/SAT problems * Hybrid CSP/SAT solvers * Local search in CSP and SAT * Parallelization and real-time competition between CSP and SAT solvers, cross-talk between the solvers * Commonalities and differences in the theory of CSP and SAT solving * Intermediate problems (e.g., satisfiability modulo theories, pseudo- Boolean) and their relations to both CSP and SAT * Applications: ways to determine which framework works best for which application * Combined benchmarks, characterization of benchmarks * Additional related topics Invited Speaker --------------- Toby Walsh, NICTA and University of New South Wales: Encoding Global Constraints into SAT