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.
Program (See also the
FLoC Live Program)
- Session 1: Practical MSO Model Checking 1
- Bruno Courcelle - Monadic Second-Order Model Checking with Fly-Automata (65 min.)
- Lukas Holik - Lazy Automata Techniques for WS1S (25 min.)
- Session 2: Practical MSO Model Checking 2
- Peter Rossmanith - Courcelle's theorem - A game-theoretic approach (65 min.)
- Dmitriy Traytel - A Derivative-Based Decision Procedure for WS1S (25 min.)
- Lunch -
- Session 3: Frameworks
- Robert Giegerich - Declarative Dynamic Programming with Inverse Coupled Rewrite Systems (60 min.)
- Eugenia Ternovska - A Logic of Information Flows (30 min.)
- Session 4: Modelling and Solving
- Alan Frisch - ESSENCE A Language for Specifying Combinatorial Problems (25 min.)
- Ozgur Akgun - Automated Constraint Modelling with Conjure (25 min.)
- Jonahnes Fichte - Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth (25 min.)
- Sabine Bauer - Decidable Linear Tree Constraints (25 min.)
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
Organizers
- David Mitchell, SFU
- Bart Bogaerts, KUL
- Sima Jamali, SFU
Program Committee
- Bart Bogaerts, KU Leuven
- Alan Frisch, University of York
- Marijn Heule, UT Austin
- Neil Immerman, University of Massachusetts
- Sima Jamali, SFU
- David Mitchell, SFU
- Peter Rossmanith, RWTH Aachen University
- Mirek Truszczynski, University of Kentucky
- Stefan Woltran, TU Wein
Steering Committee
- Marc Denecker, Katholieke Universitat Leuven
- Victor Marek, University of Kentucky
- David Mitchell, Simon Fraser University
- Eugenia Ternvoska, Simon Fraser University
- Mirek Truszczynski, University of Kentucky