JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for CPHC-CONF Archives


CPHC-CONF Archives

CPHC-CONF Archives


cphc-conf@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

CPHC-CONF Home

CPHC-CONF Home

CPHC-CONF  March 2008

CPHC-CONF March 2008

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

LaSh08 Call for Papers

From:

Marc Denecker <[log in to unmask]>

Reply-To:

Marc Denecker <[log in to unmask]>

Date:

Thu, 6 Mar 2008 12:51:45 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (151 lines)

              LaSh08 - WORKSHOP ON LOGIC AND SEARCH
     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.


Workshop format:
================

The workshops objective is to create an informal, stimulating
atmosphere for exchange of ideas. We invite also reports of work in
progress. There will be informal proceedings. 


Organizing Committee 
====================
    * Enrico Giunchiglia,  University of Genova
    * Victor Marek,  University of Kentucky
    * David Mitchell,   Simon Fraser University
    * Eugenia Ternovska  Simon Fraser University 
    * Mirek Truzczynski,  University of Kentucky
    * Marc Denecker, K.U.Leuven 

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.

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager