LaSh 2019 Workshop on Logic and Search,
Associated with SAT 2019
July 8 2019, Lisboa Portugal
http://www.logicandsearch.org/LaSh2019/
Submission deadline: June 18
The LaSh Workshops on Logic and Search are devoted to the study
of logic-based methods for solving search and optimization based
on declarative problem specifications or representations. Relevant
work comes from research communities focused on satisfiability-based
problem solving, constraint-based modelling and solving, knowledge
representation and reasoning, theorem proving, descriptive
complexity, model checking, and query answering.
For further information on LaSh workshops (e.g., programs of previous
LaSh workshops) please see the LaSh web page, www.logicandsearch.org.
Topics of Interest include:
Specification and Modelling Languages: Design, Analysis, Application
Ground Languages and Solvers: SAT; SMT; ASP; ILP; etc.
Reductions: e.g., theory of good reductions; empirical studies
Interpretations and Transductions in problem solving
Grounding: e.g., Efficient, Lazy and incremental grounding
Structural Properties of Instances: e.g., tractabible families
Reformulation and Specifiction-Level Reasoning
Descriptive Complexity and experiments with finite model finding
Declarative Dynamic Programming
Applications and System Descriptions
Those interested in presenting at LaSh should send a message to
lash2019@logicandsearch.org, as soon as possible and no later than
June 18, including a paper, extended abstract, or description of
a proposed talk. Notification will be online, not batch.
LaSh 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
---------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
