The LaSh Workshops on Logic and Search are devoted to the study, from the point of view of logic, of declarative languages for defining or representing search and optimization problems, problem-solving systems that use these languages, and related issues regarding reductions, search algorithms, problem transformations, and others. See the LaSh home page for details of previous meetings.
Topics of Interest (non-exclusive):
-Descriptive Complexity E.g. for logics with interesting ``built-in'' operators; over structures with arithmetic, strings, etc.
-Specification and Modelling Languages Design, Analysis and Use of constraint Modelling languages, algebraic modelling languages, answer set programming languages, and other declarative specification and modelling languages.
-Reductions ``Good'' reductions; Automatic generation of reductions; logically defined reductions; tools for defining reductions.
-Structural Properties of Instances e.g., Treewidth and other graph width measures, especially with respect to specifications, grounders and solvers.
-Reformulation and Specification-Level Reasoning
-Declarative Dynamic Programming
-Grounding Lazy and incremental grounding; avoiding grounding; designa and implementation of grounders.
-Modularity and Compositionality In languages and systems.
-Ground Languages and Solvers SAT; SMT; ASP; Finite-Domain Constraint Satisfaction; ILP; pseudo-boolean constraints, extensions of SAT.
-Applications and System Descriptions