LaSh 2008: LOGIC AND SEARCH
Computation of structures from declarative descriptions
The 2nd International Workshop on Logic and Search (LaSh 2008) will be held on November 6-7th 2008, in the city of Leuven, Belgium.
In many real-life problems, we search for objects of complex nature &mdash plans, schedules, assignments. Such objects are often represented as (finite) structures, which are implicitly specified by means of theories in some logic. Thus, languages are needed to describe structures, and algorithms to extract them from these implicit descriptions. Propositional Satisfiability (SAT), Constraint Programming (CP), and Answer Set Programming (ASP) are arguably the three most prominent areas that develop such languages and techniques.
LaSh08 aims to offer a discussion forum for research in SAT, ASP and CP that focuses on the computation of structures from declarative descriptions. We invite contributions on modeling languages, methodologies, theoretical analysis, techniques, algorithms and systems. The forum is an occasion to exchange ideas on the state-of-the-art; to discuss specific technical problems; to formulate challenges and opportunities ahead; to analyse differences and simularities between the different areas; to study opportunities for synergy and integration.
Further information can be found on this page.
- modeling languages and constructs
- comparisons of different languages
- criteria for choice of modeling languages
- efficient modeling strategies
- new applications
- complexity results, tractable subsets
- completeness results (e.g. capturing complexity classes)
- methods for taking advantage of tractability results
- new algorithm directions
- SAT modulo theories
- integrations of SAT, ASP and/or CP technologies
- solver implementation techniques
- algorithms for grounding
- search control and heuristics
- symmetry breaking in model construction
- optimisation problems in model construction:
- languages for optimality criteria;
- algorithms for computing optimal models
