LaSh 2019 Workshop on Logic and Search

July 8 2019, Liboa, Portugal --- a SAT 2019 Workshop

Program Topics of Interest Organization Submission

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)

Topics of Interest (non-exclusive)

Researchers interesting in presenting their work at LaSh 2019 should send a paper, or a description of a proposed talk, by email to, 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.

Steering Committee