LICS Newsletter 114

Newsletter 114 March 14, 2008 ******************************************************************* * Past issues of the newsletter are available at http://www.informatik.hu-berlin.de/lics/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://www.informatik.hu-berlin.de/lics/newsletters/inst.html * To unsubscribe, send an email with "unsubscribe" in the subject line to lics@informatik.hu-berlin.de ******************************************************************* TABLE OF CONTENTS * ANNOUNCEMENTS LICS 2008 - List of accepted papers * CONFERENCES AND WORKSHOPS SECRET 2008 - Call for Papers AiML-2008 - Third Call for papers SPIN 2008 - Final Call for Papers IMLA 2008 - Call for Papers COMPULOG/ALP Summer School VERIFY 2008 - Call for Papers ICLP 2008 - Call for Papers LASH 2008 - Call for Papers * POSITIONS POSTDOC AND PROGRAMMER POSITIONS - University of New South Wales, Austral= ia LOGIC IN COMPUTER SCIENCE (LICS) 2008 List of Accepted Papers - Klaus Aehlig and Arnold Beckmann. On the Computational Complexity of Cut-Reduction - Christian Urban, James Cheney and Stefan Berghofer. Mechanising the Metatheory of LF - Matthew Hague, Andrzej Murawski, Luke Ong and Olivier Serre. Collapsible Pushdown Automata and Recursion Schemes - Francois Pottier. Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule - Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye and = Marcus Groesser. Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automat= a - Taolue Chen and Wan Fokkink. On the Axiomatizability of Impossible Futures: Preorder versus Equivale= nce - Ivan Lanese, Jorge A. Perez, Davide Sangiorgi and Alan Schmitt. On the Expressiveness and Decidability of Higher-Order Process Calculi - Mikolaj Bojanczyk, Luc Segoufin and Howard Straubing. Piecewise Testable Tree Languages - Barnaby Martin, Florent Madelaine and Hubie Chen. Quantified Constraints and Containment Problems - Marc de Falco. The Geometry of Interaction of Differential Interaction Nets - Soren B. Lassen and Paul Blain Levy. Typed Normal Form Bisimulation for Parametric Polymorphism - Arnaud Carayol, Matthew Hague, Antoine Meyer, Luke Ong and Olivier Serr= e. Winning Regions of Higher-Order Pushdown Games - James F. Lynch. A Logical Characterization of Individual-Based Models - Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb\'an and Andre Nies. From Automatic Structures to Borel Structures - David Duris. Hypergraph Acyclicity and Extension Preservation Theorems - Pierre Chambart and Philippe Schnoebelen. The Ordinal Recursive Complexity of Lossy Channel Systems - Soren Riis. On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complex= ity - Vineet Kahlon. Parameterization as Abstraction: A Tractable Approach to the Dataflow A= nalysis of Concurrent Programs - Roberto Maieli and Olivier Laurent. Local Cut Elimination for Monomial MALL Proof Nets - Adri=C3=A0 Gasc=C3=B3n, Guillem Godoy and Manfred Schmidt-Schauss. Context Matching for Compressed Terms - Andrzej Murawski. Reachability Games and Game Semantics: On Comparing Nondeterministic Pr= ograms - Emmanuel Beffara. An Algebraic Process Calculus - Makoto Tatsuta. Types for Hereditary Permutators - Martin Grohe. Definable Tree Decompositions - Catarina Carvalho, Victor Dalmau and Andrei Krokhin. Caterpillar Duality for Constraint Satisfaction Problems - Olivier Delande and Dale Miller. A Neutral Approach to Proof and Refutation in MALL - Virgile Mogbil and Paulin Jacob=C3=A9 de Naurois. Correctness of Multiplicative Additive Proof Structures is NL-Complete - Guillaume Burel. A First-Order Representation of Pure Type Systems using Superdeduction - Tomas Brazdil, Jan Kretinsky, Antonin Kucera and Vojtech Forejt. The Satisfiability Problem for Probabilistic CTL - Abbas Edalat. Weak Topology and Differentiable Operator for Lipschitz Maps - Gordon Plotkin and Matija Pretnar. A Logic for Algebraic Effects - Agata Ciabattoni, Nikolaos Galatos and Kazushige Terui. From Axioms to Analytic Rules in Nonclassical Logics - Rohit Chadha, A. Prasad Sistla and Mahesh Viswanathan. On the Expressiveness and Complexity of Randomization in Finite State M= onitors - Victor Dalmau and Benoit Larose. Maltsev + Datalog -> Symmetric Datalog - Sam Staton. General Structural Operational Semantics through Categorical Logic - Carsten Sch=C3=BCrmann and Jeffrey Sarnat. Structural Logical Relations - Andrew Gacek, Dale Miller and Gopalan Nadathur. Combining Generic Judgments with Recursive Definitions - Marcelo Fiore. Second-Order and Dependently-Sorted Abstract Syntax - Daniel R Licata, Noam Zeilberger and Robert Harper. Focusing on Binding and Computation 3RD INTERNATIONAL WORKSHOP ON SECURITY AND REWRITING TECHNIQUES (SecReT'08) http://www.dsic.upv.es/workshops/secret08 Sunday, June 22, 2008, Pittsburgh, USA Affiliated workshop of the 21st IEEE Computer Security Foundations Symposium (CSF) and the 23rd IEEE Symposium on Logic In Computer Science (LICS) * IMPORTANT DATES Abstract Submission March 31, 2008 Full Paper Submission April 6, 2008 Acceptance Notification May 12, 2008 Camera Ready May 26, 2008 Workshop June 22, 2008 * SCOPE The aim of this workshop is to bring together rewriting researchers and security experts, in order to foster their interaction and develop future collaborations in this area, provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. The workshop focuses on the use of rewriting techniques in all aspects of security. Specific topics include: authentication, encryption, access control and authorization, protocol verification, specification of policies, intrusion detection, integrity of information, control of information leakage, control of distributed and mobile code, etc. * Previous instances of SecRet were held in 2006 (S. Servolo, Venice, Italy), and 2007 (Paris, France). * LOCATION SecReT'08 will be held at Carnegie Mellon University in Pittsburgh, Pennsylvania, USA. The workshop is associated with the 21st IEEE Computer Security Foundations Symposium (CSF'08) and the 23rd IEEE Symposium on Logic in Computer Science (LICS'08). * SUBMISSION PROCEDURE Submission is web-based via a link available in the main web page. Submissions must be received by April 6, 2008. In addition, a title and abstract must be submitted by March 31, 2008. Submitted papers should be at most 15 pages in the ENTCS style, and should include an abstract and the author's information. See the author's instructions of ENTCS style at http://www.entcs.org. * PUBLICATION Accepted papers will be published in a preliminary volume available during the workshop. After the workshop, a final version of the proceedings will be published in the Elsevier series Electronic Notes in Theoretical Computer Science (ENTCS). * INVITED SPEAKERS Hubert Comon Cachan, France Jonathan Millen MITRE, USA * PROGRAM CO-CHAIRS Daniel Dougherty Worcester Polytechnic Institute, USA Santiago Escobar Technical University of Valencia, Spain * PROGRAM COMMITTEE Pierpaolo Degano Pisa, Italy Daniel Dougherty Worcester, USA Santiago Escobar Valencia, Spain Maribel Fernandez King's College London, UK Thomas Genet IRISA Rennes, France Joshua Guttman MITRE, USA Catherine Meadows NRL, USA Monica Nesi L'Aquila, Italy Michael Rusinowitch Lorraine, France Ralf Treinen Paris-7, France ADVANCES in MODAL LOGIC (AiML-2008) 9-12 September 2008, LORIA, Nancy, France http://aiml08.loria.fr * DEADLINE: 31 March 2008 - SITE OPEN FOR SUBMISSIONS Advances in Modal Logic is an initiative aimed at presenting an up-to-date picture of the state of the art in modal logic and its many applications. The initiative consists of a conference series together with volumes based on the conferences. * AiML-2008 is the seventh conference in the series. * TOPICS We invite submission on all aspects of modal logics, including the following: - history of modal logic - philosophy of modal logic - applications of modal logic - computational aspects of modal logic + complexity and decidability of modal and temporal logics + modal and temporal logic programming + model checking + theorem proving for modal logics - theoretical aspects of modal logic + algebraic and categorical perspectives on modal logic + coalgebraic modal logic + completeness and canonicity + correspondence and duality theory + many-dimensional modal logics + modal fixed point logics + model theory of modal logic + proof theory of modal logic - specific instances and variations of modal logic + description logics + dynamic logics and other process logics + epistemic and deontic logics + modal logics for agent-based systems + modal logic and game theory + modal logic and grammar formalisms + provability and interpretability logics + spatial and temporal logics + hybrid logic + intuitionistic logic + monotonic modal logic + substructural logic Papers on related subjects will also be considered. * INVITED SPEAKERS Invited speakers at AiML-2008 will include the following: - Mai Gehrke, Radboud Universiteit Nijmegen http://www.math.ru.nl/~mgehrke/ - Guido Governatori, The University of Queensland http://www.itee.uq.edu.au/~guido/ - Agi Kurucz, King's College London http://www.dcs.kcl.ac.uk/staff/kuag/ - Lawrence Moss, Indiana University http://www.indiana.edu/~iulg/moss/ - Michael Zakharyaschev, Birkbeck College http://www.dcs.bbk.ac.uk/~michael/ * PAPER SUBMISSIONS In a change from previous AiML's, there will be two types of paper: (1) Full papers for publication and presentation at the conference. (2) Abstracts for short presentation only. Both types of paper should be submitted electronically using the submission page at http://www.easychair.org/AiML08/ The online submission system is now open. The submission deadline is 31 March 2008. * PROGRAMME COMMITTEE Alessandro Artale (Free University of Bolzano, Italy) Philippe Balbiani (IRIT, Toulouse, France) Alexandru Baltag (University of Oxford, UK) Guram Bezhanishvili (New Mexico State University, USA) Patrick Blackburn (LORIA, France) Stephane Demri (CNRS, Cachan, France) Melvin Fitting (City University of New York, USA) Guido Governatori (University of Queensland, Australia) Silvio Ghilardi (University of Milano, Italy) Valentin Goranko (University of the Witwatersrand, South Africa) Rajeev Gore (The Australian National University, Australia) Andreas Herzig (IRIT, Toulouse, France) Ian Hodkinson (Imperial College London, UK) Ramon Jansana (University of Barcelona, Spain) Alexander Kurz (University of Leicester, UK) Carsten Lutz (Dresden University of Technology, Germany) Edwin Mares (Victoria University of Wellington) Larry Moss (Indiana University, USA) Dirk Pattinson (Imperial College London, UK) Mark Reynolds (University of Western Australia, Australia) Ildiko Sain (Hungarian Academy of Sciences) Ulrike Sattler (University of Manchester, UK) Renate Schmidt (University of Manchester, UK) Jerry Seligman (University of Auckland, New Zealand) Valentin Shehtman (Moscow State University, Russia) Nobu-Yuki Suzuki (Shizuoka University, Japan) Yde Venema (ILLC, University of Amsterdam, The Netherlands) Heinrich Wansing (Dresden University of Technology, Germany) Frank Wolter (University of Liverpool, UK) Michael Zakharyaschev (Birkbeck College, London, UK) * IMPORTANT DATES Submission deadline: 31 March 2008 Acceptance notification: 31 May 2008 Final version of full papers due: 30 June 2008 Conference: 9-12 September 2008 * CONFERENCE LOCATION Advances in Modal Logic 2008 will be held at LORIA (Laboratoire Lorrain de Recherche en Informatique et ses Applications) in Nancy, in the Lorraine, in the east of France. * FURTHER INFORMATION Information about AiML-2008 will be available at the conference website: http://aiml08.loria.fr 15TH INT. SPIN WORKSHOP ON MODEL CHECKING OF SOFTWARE (SPIN) Final Call for Papers August 10-12, 2008 University of California Los Angeles, USA http://compilers.cs.ucla.edu/spin08 * Aim and Scope: The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. Theoretical techniques and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker or other tools, or techniques based on combination of explicit representations with other representations, are the focus of this workshop. We particularly welcome papers describing the development and application of state space exploration techniques in testing and verifying security-critical software, enterprise and web applications, embedded software, and other interesting software platforms. The workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. * Invited speakers: - Matthew Dwyer (University of Nebraska) - Daniel Jackson (MIT) - Shaz Qadeer (Microsoft Research) - Wolfram Schulte (Microsoft Research) - Yannis Smaragdakis (University of Oregon) * Important Dates and Deadlines: Deadline for submission of full papers: April 2, 2008 Notification of acceptance/rejection: May 10, 2008. Deadline for final version of accepted papers: May 28, 2008. Workshop: August 10-12, 2008. * Important Dates and Deadlines: Deadline for submission of full papers: April 2, 2008 Notification of acceptance/rejection: May 10, 2008. Deadline for final version of accepted papers: May 28, 2008. Workshop: August 10-12, 2008. * Topics of Interest: - Algorithms and storage methods for explicit state model checking - Directed model checking using heuristics - Parallel or distributed model checking using multi-core or multiple computers - Techniques for dealing with infinite state spaces - Model checking of timed and probabilistic systems - Abstraction and the use of static analysis to reduce state spaces - Combinations of enumerative and symbolic techniques - Analysis for modeling languages, including SE languages (UML,...) - New property specification languages, including new forms of temporal logic - Model checking of programming languages and code analysis - Automated testing using model checking techniques - Derivation of invariants, test cases, or other useful information from state spaces - Combination of model-checking techniques with other analysis techniques - Modularity and compositionality - Comparative studies, including to other model checking techniques - Case studies of interesting systems or with interesting results - Theoretical and algorithmic foundations of model-checking based analysi= s - Engineering and implementation of model-checking tools and platforms - Insightful surveys or historical accounts on topics of relevance to SPIN workshops * Organization: General Chair: Jens Palsberg (UC Los Angeles, USA) Programme Chairs: - Klaus Havelund (NASA JPL/Caltech., USA) - Rupak Majumdar (UC Los Angeles, USA) * Programme Committee: Christel Baier (Bonn, Germany) Dragan Bosnacki (Eindhoven, Netherlands) Lubos Brim (Brno, Czech) Stefan Edelkamp (Dortmund, Germany) Dawson Engler (Stanford, USA) Kousha Etessami (Edinburgh, UK) Susanne Graf (Verimag, France) John Hatcliff (Kansas State Univ., USA) Gerard Holzmann (NASA JPL, USA) Franjo Ivancic (NEC, USA) Sarfraz Khurshid (UT Austin, USA) Kim Larsen (Aalborg, Denmark) Madan Musuvathi (Microsoft, USA) Joel Ouaknine (Oxford, UK) Corina Pasareanu (NASA Ames, USA) Doron Peled (Warwick, UK) Paul Pettersson (Malardalen, Sweden) Koushik Sen (Berkeley, USA) Natasha Sharygina (Lugano, Switzerland) Eran Yahav (IBM, USA) FOURTH INTERNATION WORKSHOP ON INTUITIONISTIC MODAL LOGIC AND APPLICATIONS = (IMLA'08) http://www.cs.bham.ac.uk/~vdp/IMLA08.html A LICS'08 affiliated workshop Pittsburgh, Pennsylvania, June 23, 2008 * Constructive modal logics and type theories are of increasing foundationa= l and practical relevance in computer science. Applications are in type disciplines for programming languages, and meta-logics for reasoning abou= t a variety of computational phenomena. Theoretical and methodological issues center around the question of how the proof-theoretic strengths of constructive logics can best be combined with the model-theoretic strengths of modal logics. Practical issues center around the question which modal connectives with associated laws or proof rules capture computational phenomena accurately and at the right level of abstraction. This workshop will bring together designers, implementers, and users to discuss all aspects of intuitionistic modal logics and type theories. * Topics include, but are not limited to: - applications of intuitionistic necessity and possibility - monads and strong monads - constructive belief logics and type theories - applications of constructive modal logic and modal type theory to formal verification, foundations of security, abstract interpretation, and program analysis and optimization - modal types for integration of inductive and co-inductive types, higher= \ - order abstract syntax, strong functional programming - models of constructive modal logics such as algebraic, categorical, Kripke, topological, and realizability interpretations - notions of proof for constructive modal logics - extraction of constraints or programs from modal proofs - proof search methods for constructive modal logics and their implementations * The workshop continues a series of previous LICS-affiliated workshops, which were held as part of FLoC'99, Trento, Italy and of FLoC'02, Copenhagen, Denmark. * IMPORTANT DATES: Submission: April 25, 2008 Notification: May 23, 2008 Final papers due: June 7, 2008 Workshop Date: June 23, 2008 * PROGRAM COMMITTEE: Gavin Bierman (Microsoft, UK) Valeria de Paiva (PARC, USA) Michael Mendler (Bamberg, DE) Aleks Nanevski (Microsoft, UK) Brigitte Pientka (McGill, CA) Eike Ritter (Birmingham, UK) * INVITED SPEAKERS: Frank Pfenning (CMU, USA) Torben Brauner (Roskilde, RK) * CONTACTS Valeria de Paiva Aleks Nanevski PARC, Palo Alto Research Center Microsoft Research paiva@parc.xeroc.com aleksn@microsoft.com 3RD INTERNATIONAL COMPULOG/ALP SUMMER SCHOOL ON LOGIC PROGRAMMING AND COMPU= TATIONAL LOGIC Sponsored by CRA-W, CDC, ALP, Compulog Americas, NMSU http://www.cs.nmsu.edu/~ipivkina/compulog.htm New Mexico State University Las Cruces, NM, USA July 24-27, 2008 * The third international summer school in Logic Programming and Computation Logic will be held on the campus of New Mexico State University in beautiful Las Cruces, New Mexico. The summer school is intended for graduate students, post-doctoral students, young researchers, and programmers interested in constraints, logic programming, computational logic and their applications. The lectures will be given by internationally renowned researchers who have made significant contributions to the advancement of these disciplines. The summer school is a good opportunity for quickly acquiring background knowledge on important areas of computational logic. The summer school is especially directed to Ph.D. students who are just about to start research. Exceptional undergraduate students in their senior year are also encouraged to attend. * The summer school will consist of six 1/2 day tutorials on the following topics: - Theoretical Foundations of Logic Programming [Miroslaw Truszczynski, U. of Kentucky] - Answer Set Programming [Torsten Schaub, U. of Potsdam] - Implementation and Execution Models for Logic Programming [Manuel Hermenegildo, Polytechnic Univ. of Madrid] - Logic Programming and Multi-agent Systems [Francesca Toni, Imperial College] - Foundations of Constraint and Constraint Logic Programming [TBA] - Foundations of Semantic Web and Computational Logic [Sheila McIlraith, University of Toronto] * Registration Due to the limit on the number of slots available, we invite interested student to submit an application for admission to the summer school composed of the following items: 1. a one page statement of interest, explaining your research background and what you expect to gain from the summer school 2. a short (2-page) vitae * Applications should be submitted in electronic form to: epontell@cs.nmsu.edu and ipivkina@cs.nmsu.edu * All submissions will be acknowledged with an email. If you do not receive acknowledgement within 3 working days, please email Enrico Pontelli (epontell@cs.nmsu.edu). * Important dates Requests for student grants: April 15, 2008; Application for Admission: April 25, 2008; Notification of Admission and grants: May 1st, 2008; Summer School: July 24-27, 2008 * Organizers Enrico Pontelli, New Mexico State University, USA Inna Pivkina, New Mexico State University, USA Karen Villaverde, New Mexico State University, USA Son Cao Tran, New Mexico State University, USA VERIFY'08 - 5th International Verification Workshop Call for Papers August 10-11, 2008, Sydney, Australia http://www.uni-koblenz.de/~beckert/verify08/ * The VERIFY workshop series aims at bringing together people who are inter= ested in the development of safety and security critical systems, in formal met= hods, in the development of automated theorem proving techniques, and in the development of tool support. Practical experiences gained in realistic verifications are of interest to the automated theorem proving community = and new theorem proving techniques should be transferred into practice. The overall objective of the VERIFY workshops is to identify open problems an= d to discuss possible solutions under the theme What are the verification problems? What are the deduction techniques? * The scope of VERIFY includes topics such as: + ATP techniques in verification + Information flow control + Case studies (specif. & verific.) + Refinement & Decomposition + Combination of verification tools + Reliability of mobile compu= ting + Integration of ATPs and CASE-tools + Reuse of specifications & p= roofs + Compositional & modular reasoning + Management of change + Experience reports on using verification + Safety-critical systems + Gaps between problems and techniques + Security models + Formal methods for fault tolerance + Tool support for formal met= hods * Important dates: Extended Abstract Submission Deadline: May 15, 2008 Extended Paper Submission Deadline: May 22, 2008 Notification of acceptance: June 25, 2008 Final version due: July 10, 2008 Workshop: August 10-11, 2008 24TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP'08) First call for papers Udine, Italy, December 9th-13th, 2008 http://iclp08.dimi.uniud.it * CONFERENCE SCOPE Since the first conference held in Marseilles in 1982, ICLP has be= en the premier international conference for presenting research in logic progra= mming. Contributions (papers, position papers, and posters) are sought in all ar= eas of logic programming including but not restricted to: - Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning, Knowledge Representation. - Implementation: Compilation, Memory Management, Virtual Machines, Paral= lelism. - Environments: Program Analysis, Program Transformation, Validation= and Verification, Debugging, Profiling, Integration. - Language Issues: Extensions, Integration with Other Paradigms, Concur= rency, Modularity, Objects, Coordination, Mobility, Higher Order, Types, M= odes, Programming Techniques. - Related Paradigms: Abductive Logic Programming, Inductive Logic Progra= mming, Constraint Logic Programming, Answer-Set Programming. - Applications: Databases, Data Integration and Federation, So= ftware Engineering, Natural Language Processing, Web and Semantic Web, Ag= ents, Artificial Intelligence, Bioinformatics * The three broad categories for submissions are: (1) Technical papers, providing novel research contributions, innova= tive perspectives on the field, and/or novel integrations across diffe= rent areas; (2) Application papers, describing innovative uses of logic program= ming technology in real-world application domains; (3) Posters, ideal for presenting and discussing current work, not yet r= eady for publication, for PhD thesis summaries and research project overv= iews. * WORKSHOPS The ICLP'08 program will include several workshops. They are perhaps th= e best place for the presentation of preliminary work, novel ideas, and ne= w open problems to a more focused and specialized audience. Workshops also pro= vide a venue for presenting specialised topics and opportunities for int= ensive discussions and project collaboration in any areas related to = logic programming, including cross-disciplinary areas. * IMPORTANT DATES Papers Posters Abstract submission deadline June 2nd n/a Submission deadline June 9th August 15th Notification of authors August 1st September 1st Camera-ready copy due September 15th September 15th 20 Years of Stable Models TBA Doctoral Consortium TBA Workshop Proposals June 2nd Early-bird Registration TBA Conference December 9-13, 2008 * Program Committee: Salvador Abreu Sergio Antoy Pedro Barahona Chitta Baral Gerhard Brewka Manuel Carro Michael Codish Alessandro Dal Palu' Bart Demoen Agostino Dovier John Gallagher Michael Gelfond Carmen Gervet Gopal Gupta Manuel Hermenegildo Andy King Michael Maher Juan Moreno Navarro Alberto Pettorossi Brigitte Pientka Gianfranco Rossi Fariba Sadri Vitor Santos Costa Tran Cao Son Paolo Torroni Frank Valencia Mark Wallace WORKSHOP ON LOGIC AND SEARCH (LaSh08) Computation of structures from declarative descriptions Call For Papers Leuven, Belgium, November 6-7, 2008 http://www.cs.kuleuven.be/~dtai/LaSh08 * IMPORTANT DATES Submission: August 15, 2008 Notification: September 15, 2008 Workshop: November 6-7, 2008 * SCOPE In many real-life problems, we search for objects of complex nature -- 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. Each of these areas has been proposed as a declarative programming approach to solving NP-complete combinatorial problems. Such problems abound in computer science, engineering, operations research computational biology and other fields. In many cases, progress is limited by the difficulty of designing implicit representations of structures (modeling), which hinders common acceptance of the aproach, and the inability to solve sufficiently large instances of the problems in practical time bounds (search algorithms). Therefore, these three areas have as a major goal the development of practical modeling languages and methodologies that support the modeling, and algorithms and tools for efficient problem solving. Despite the similar goals of these areas, in many respects SAT, ASP and CP develop as three independent disciplines, focusing on rather different particular problems or questions. There are few, if any, researchers who are experts in all three areas. To date, we are not aware of any meeting which specifically aims at bringing these three areas together. * Objectives 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. * In particular, we would like to foster exchange at least on the following topics: - integrations of SAT, ASP and/or CP technologies - comparisons of modeling languages - criteria for choice of modeling languages (for modeling convenience or efficiency) - new algorithm directions - efficient modeling strategies - new applications - complexity results, tractable subsets - completeness results (e.g. capturing complexity classes) - methods for taking advantage of tractability results - solver implementation techniques, - algorithms for grounding - modeling languages and constructs (aggregates, global constraints,..) - search control and heuristics in the context of model generation - symmetry breaking in model construction - optimisation problems in model construction: - languages for optimality criteria; - algorithms for computing optimal models * Systems and Tools: LaSh08 will also provide an opportunity for presentation of implemented systems and tools at a demo session. Thus, we invite submissions of systems and tools that reflect the above ideas, and aim at facilitating declarative problem solving, and making it practical and used. * Program Committee - Peter Baumgartner, The Australian National University - Francesco Calimeri, University of Calabria - Thomas Eiter, Vienna University of Technology - Wolfgang Faber, University of Calabria - Pierre Flener, Uppsala University - Alan Frisch, University of York - Enrico Giunchiglia, University of Genova - Daniel LeBerre, Universite d'Artois - Fangzen Lin, Hong kong University of Science and Technology - Ines Lynce, Universidade Tecnica de Lisboa - Tony Mancini, Sapienza Universita di Roma - Victor Marek, University of Kentucky - David Mitchell, Simon Fraser University - Pierre Marquis, Universite d'Artois - Ilkka Niemela, Helsinki University of Technology - Karem Sakallah, University of Michigan - Torsten Schaub, University of Potsdam - Barry O'Sullivan, University College Cork - Eugenia Ternovska Simon Fraser University - Mirek Truszcznski, University of Kentucky - Pascal Van Hentenryck, Brown University - Toby Walsh, University of New South Wales * Local organisation - Marc Denecker, K.U.Leuven - Joost Vennekens, K.U.Leuven * Location The conference will take place in the Beguinage of Leuven, Belgium. Leuven is an old flemish town, hosting the oldest university of the lower countries. The Beguinage is a medieval city in the city, where the beguines lived together to form a religious community. The Beguinage is recognized as a Unesco World Heritage site. POSTDOC AND PROGRAMMER POSITIONS ARE AVAILABLE IN THE SCHOOL OF COMPUTER SC= IENCE AND ENGINEERING, UNIVERSITY OF NEW SOUTH WALES, AUSTRALIA. * The positions are associated to an Australian Research Council Linkage Grant funded project "Model Checking Logics of Knowledge and Probability in Pursuit-Evasion Games". The research will involve the development of model checking techniques for the logic of knowledge, probability and time, and their evaluation in the partner's application: pursuit-evasion games motivated from search and rescue mission planning problems. * For details, see http://www.cse.unsw.edu.au/~meyden/positions/.