The LaSh 2017 Workshop on Logic and Search

August 28 2017,  Melbourne Australia - A SAT/CP/ICLP Workshop

The LaSh Workshops on Logic and Search are devoted to the study of logic-based methods for specifying and solving computational search and optimization problems, with particular emphasis on solving based on high-level, declarative, problem specifications.

LaSh 2017 will be held on August 28, in Melbourne Australia. It is a joint ICLP/ SAT/ CP workshop, immediately following IJCAI 2017. See the LaSh home page for details of previous meetings.

Preliminary Schedule:

• 8:30 - Opening
• 8:35 - John Hooker, CMU - Projection in Logic, CP and Optimization
• 9:40 - David Mitchell, SFU - Logic and Search Mini-Tutorial
• 10:00 - Coffee
• 10:30 - Victor Lagerqvist, TU Dresden - Constraint Satisfaction and Universal Algebra
• 10:55 - Francesco Ricca - Generating Hard Random Boolean Formulas and Disjunctive Logic Programs
• 11:15 - David Powers, Flinders - A CLP Approach to Map 4-Colouring
• 11:35 - Bernhard Bliem, TU Wien - Impact of Treewidth on ASP Grounding and Solving
• 12:00 - LaSh Lunch

LaSh Steering Committee:

• Marc Denecker, KU Leuven
• Victor Marek, University of Kentucky
• David Mitchell, Simon Fraser University
• Mirek Truszczynski, University of Kentucky
• Evgenia Ternovska, Simon Fraser University

LaSh 2017 Organization and Program Committee

• David Mitchell (mitchell at cs dot sfu dot ca)

• Bart Bogaerts, KU Leuven
• Marc Denecker, KU Leuven
• Marijn Heule, University of Texas at Austin
• Tomi Janhunen, Aalto University
• Victor Marek, University of Kentucky
• David Mitchell, Simon Fraser University
• Peter Rossmanith, RWTH Aachen
• Shahab Tasharrofi, Aalto University
• Eugenia Ternovska Simon Fraser University
• Mirek Truszczynski, University of Kentucky
• Stefan Woltran, TU Wien