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.
Preliminary Program
| 9:10 - 9:30 | David Mitchell | LaSh Welcome and Tutorial |
| 9:30 - 10:30 | Martina Seidl | Recent QBF Reasoning Techniques |
| 10:30 - 11:00 | Coffee | |
| 11:00 - 11:45 | Isabel Oitavem | A Recursion-Theoretic Approach to the Polynomial Heirarchy |
| 11:45 - 12:30 | Antonius Weinzierl | Lazy Grounding for Answer Set Programming: Challenges and Potential (abstract) |
| 12:30 - 14:00 | Lunch | |
| 14:00 - 15:00 | Konstantin Korovin | Solving Non-linear Constraints in CDCL Style (abstract) |
| 15:00 - 15:30 | Mario Wenzel | Prolog API for LEGO EV3 (abstract) |
| 15:30 - 16:00 | Coffee | |
| 16:00 - 16:30: | Katalin Fazekas | Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories. (abstract) |
| 16:30 = 17:00 | Pierre Carbonnelle | Abstract Model Generation in an Interactive Configuration Tool (abstract) |
Speakers
- Pierre Carbonnelle, Katholiek Universiteit Leuven
- Katalin Fazekas, Johannes Kepler Universitat Linz
- Konstantin Korovin, University of Manchester
- Isabel Oitavem, Universidade Nova de Lisboa
- Martina Seidl, Johannes Kepler Universitat Linz
-
Antonius Weinzierl,
TU Wien
- Mario Wenzel, Martin Luther Universitat Halle-Wittenberg
Topics of Interest (non-exclusive)
- Specification and Modelling Languages Design, analysis and use of declarative specification and modelling languages, including constraint and algebraic modelling languages and knowledge representation langauges;
- Descriptive Complexity Expressiveness of logics over classes of finite structures;
- Reductions "Good'' reductions; Automatic generation of reductions; transductions; tools for defining reductions.
- Structural Properties e.g., Treewidth and related measures, as applied to instance classes or to specifications;
- Reformulation and Specification-Level Reasoning
- Grounding Lazy and incremental grounding; avoiding grounding; designa and implementation of grounders.
- Declarative Dynamic Programming
- Ground Languages and Solvers SAT and extensions; SMT; ASP; Finite-Domain Constraint Satisfaction; ILP; PB, etc.;
- Applications and System Descriptions
Submission
Researchers interesting in presenting their work at LaSh 2019 should send a paper, or a description of a proposed talk, by email to lash2019@logicandsearch.org, at the earliest possible time, and not later than June 18. In the case of a paper, please indicate if it is new work or not.
Organizers
- David Mitchell, SFU
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