Combinatorial search problems arise in almost every area of computer science and a wide range of application domains. Many realistic problems are computationally challenging, complex to specify, or involve integration of multiple systems. Recent decades have seen dramatic progress in our capability of solving computationally challenging search problems. High level, declarative specification languages have begun to make it easier to exploit this computational capability. Logic based methods have been central in this development, with SAT solvers and related technologies such as ASP and SMT solvers being applied to a growing array of real problems, and representation languages based on various logics used for high-level modelling. Related tools, such as constraint modelling langauges and algebraic modelling languages, can also be viewed through the lense of logic. Current topics include development of more sophisticated solving architectures and issues in modularity and composition of languages and solvers.

The purpose of the LaSh workshops is to foster scientific exchange between researchers interested in both the theory and practice of logic-based combinatorial problem solving. The scope includes study of relevant logics, algorithms, and logic-based systems, and also study of other languages and systems from the viewpoint of logic, broadly construed. LaSh is an occasion to discuss technical problems, formulate challenges and opportunities, compare and contrast techniques of different groups, and examine possible synergies and integrations. LaSh 2016 follows previous LaSh meetings held in 2014, 2010, 2008 2006.