-------------------------------------------------------------------------------
IJCAR 2008 - The 4th International Joint Conference on Automated Reasoning
Sydney, Australia, 10th - 15th August, 2008
http://2008.IJCAR.org
Calls for Participation, Calls for Workshop Papers, Student Travel Awards
-------------------------------------------------------------------------------
Call for Participation
----------------------
Information about IJCAR's astounding program of invited speakers, technical
papers, workshops, tutorials, competitions, and social events, is available
from the IJCAR WWW pages - 2008.IJCAR.org. There are 101 reasons to attend
IJCAR, which are enumerated on the WWW site. Registration, accomodation, and
travel/visa information is there too. Book your flight to Sydney today!
-------------------------------------------------------------------------------
Calls for Workshop Papers, Tutorial Participation
-------------------------------------------------
There will be six workshops and four tutorials before IJCAR, 10th and 11th
August. See their individual WWW pages, linked from the IJCAR WWW pages, for
submission and participation information.
+ Workshops
- The 5th International Verification Workshop (VERIFY'08)
- Practical Aspects of Automated Reasoning (PAAR-2008)
- Evaluation of Systems for Higher Order Logic (ESHOL)
- Complexity, Expressibility, & Decidability in Automated Reasoning (CEDAR'08)
- Constraints in Formal Verification
- Combining Systems for Efficient and Scalable Reasoning (CoSyScaRe 08)
+ Tutorials
- Introduction to Nominal Isabelle - Christian Urban
- Formal Methods in Use at Galois, Inc. - Joe Hurd
- SMT Solvers in Program Analysis and Verification - Nikolaj Bjorner and
Leonardo de Moura
- Coalgebraic Logics and Applications (COALA) - Dirk Pattinson
-------------------------------------------------------------------------------
Student Travel Awards
---------------------
Two award schemes that provide sponsorhips to support student attendance at
IJCAR are available. See the IJCAR WWW pages for details.
-------------------------------------------------------------------------------
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
*********************************************************
* The Fourth International Workshop *
* on *
* Programming Language Interference and Dependence *
* *
* co-located with LOPSTR'08, PPDP'08 and SAS'08 *
* *
* 15 July, 2008, Valencia, Spain *
* *
* Venue: The Technical University of Valencia *
* *
* 2nd Call for Contributions *
* *
* http://www.clip.dia.fi.upm.es/Conferences/PLID08 *
* *
*********************************************************
Important Dates
===============
Expression of interest June 1, 2008
Extended abstract June 15, 2008
Workshop July 15, 2008
Workshop Description
====================
Interference and dependence are closely related concepts, the first
being the observable phenomenon connected to the second. Interference
essentially means that behaviour of some parts of a dynamic system may
influence the behaviour of other parts of the system. Dependence
specifies the relation between the semantics of sub-components of a
dynamic system.
Discovering, measuring and controlling interference is essential in
many aspects of modern computer science, in particular in security,
program analysis and verification, debugging, systems specification,
model checking, program manipulation, program slicing, reverse
engineering, data mining, distributed databases and systems
biology. Doing these things requires theories, models and semantics
for interference and dependence, as well as algorithms and tools for
analysis and reasoning about interference and dependence.
The aim of this workshop is to gather together the community of people
that study dependence and interference from the different points of
view in order to generate new possible research directions. PLID is
devoted to bridging all these communities and assisting work towards a
common goal, providing the appropriate environment for reasoning about
the state of the art in interference and dependence.
Topics of interest include but are not limited to:
* Security against unwanted interference and dependence
* Models and theories of program interference
* Algorithms for reducing or removing interference or for
ameliorating its effects
* Theory and foundations of program slicing and related dependence
analyses
* Resource declassification theories
* Semantics of dependence and interference
* Analyses based on interference and dependence
* Abstract interpretation for dependence and interference
* Dependence and interference in specifications
* Slicing models and specifications
* Interaction between dependence and refinement
Keynote Speaker
===============
Gilles Barthe, IMDEA-software (Madrid, Spain)
Submission
==========
The workshop welcomes contributions of on-going work and ideas in the
field of dependence and interference. Those who are interested in
having a talk at the workshop and/or discussing issues related with
these subjects are invited to send your expression of interest to
Samir Genaim (samir at clip.dia.fi.upm.es) before June 1st, 2008.
There will be no formal publication of papers. A web-page will be
organised collecting all the workshop contributions. Submitted
extended abstracts should be of at most 10 pages LNCS-style and should
be sent before June 15th 2008.
Program Committee
=================
David Clark Kings College, London, UK
Sebastian Danicic University of London, UK
Samir Genaim (chair) Technical University of Madrid, Spain
Roberto Giacobazzi University of Verona, Italy
Daniele Gorla University of Roma, Italy
Sebastian Hunt City University, London, UK
Herbert Wiklicky Imperial College, London, UK
Steve Zdancewic University of Pennsylvania, USA
Local organization chair
========================
Christophe Joubert Technical University of Valencia / DSIC
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
AFAIK you cannot simply turn on occurs check in standard unifications,
but it seems easy to write a simple package to do it by "peeling off"
(i.e., normalizing) clauses and using unify_with_occurs_check/2
instead of =/2:
-------------------------------------------------------------
:- use_package(use_occurs_check).
p(f(a), X, b) :-
...
-------------------------------------------------------------
==>
-------------------------------------------------------------
p(A1, X, A3) :-
unify_with_occurs_check(A1,f(a)),
unify_with_occurs_check(A3,b),
...
-------------------------------------------------------------
You may also be able to work out a slightly smarter transformation
that preserves indexing. If you do develop such a package please add
it to the repository!
Cheers --Manuel H
--
----------------------- The Ciao System Development Team --------------------
The CLIP Group | Technical University of Madrid
ciao(a)clip.dia.fi.upm.es | University of New Mexico
http://www.cliplab.org / http://www.ciaohome.org
-----------------------------------------------------------------------------
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
----------------------------------------------------------------------------
LPAR 2008
15th International Conference on
Logic for
Programming,
Artificial Intelligence and
Reasoning
Doha, Qatar
November 22-27, 2008
http://www.qatar.cmu.edu/lpar08/
The series of International Conferences on Logic for Programming,
Artificial Intelligence and Reasoning (LPAR) is a forum where, year
after year, some of the most renowned researchers in the areas of
automated reasoning, computational logic, programming languages and
their applications come to present cutting-edge results, to discuss
advances in these fields, and to exchange ideas in a scientifically
emerging part of the world. The 2008 edition will be held in Doha,
Qatar, on the premises of the Qatar campus of Carnegie Mellon
University.
Logic is a fundamental organizing principle in nearly all areas in
Computer Science. It runs a multifaceted gamut from the foundational
to the applied. At one extreme, it underlies computability and
complexity theory and the formal semantics of programming languages.
At the other, it drives billions of gates every day in the digital
circuits of processors of all kinds. Logic is in itself a powerful
programming paradigm but it is also the quintessential specification
language for anything ranging from real-time critical systems to
networked infrastructures. It is logical techniques that link
implementation and specification through formal methods such as
automated theorem proving and model checking. Logic is also the stuff
of knowledge representation and artificial intelligence. Because of
its ubiquity, logic has acquired a central role in Computer Science
education.
New results in the fields of computational logic and applications are
welcome. Also welcome are more exploratory presentations, which may
examine open questions and raise fundamental concerns about existing
theories and practices. Topics of interest include, but are not
limited to:
* Automated reasoning
* Interactive theorem proving
* Implementations of logic
* Proof assistants
* Program and system verification
* Model checking
* Rewriting and unification
* Logic programming
* Constraint programming
* Logic and databases
* Modal and temporal logics
* Proof-carrying code
* Translation validation
* Logic for the semantic web
* Foundations of security
* Description logics
* Non-monotonic reasoning
* Specification using logics
* Logic in artificial intelligence
* Lambda calculus
* Constructive logic and type theory
* Computional interpretations of logic
* Logical foundations of programming
* Logical aspects of concurrency
* Logic and computational complexity
* Knowledge representation and reasoning
* Reasoning about actions
* Proof planning
* Effectively presented structures
* Logic of distributed systems
Invited Speakers
----------------
It has been a tradition of LPAR to invite some of the most influential
researchers in the focus areas to discuss their work and their vision
for their fields. We are honored that the following members of the
community have accepted this invitation.
* Edmund Clarke, Carnegie Mellon University (USA)
Other invited speakers will be announced soon
Submission Instructions
-----------------------
Submissions must not substantially overlap papers that have been
published or that are simultaneously submitted to a journal or a
conference with proceedings. Papers should be submitted in Portable
Document Format (PDF); papers submitted in a proprietary word
processor format such as Microsoft Word cannot be considered.
Submissions can be of two types:
* Regular papers are meant to describe solid new research
results. They can be up to 15 pages long in LNCS style, including
figures, bibliography and appendices.
* Short papers are intended to report on interesting work in
progress. They can be at most 5 pages long in the LNCS style.
Papers can be electronically submitted by visiting
http://www.easychair.org/conferences/?conf=3Dlpar2008
. Prospective authors are required to register a title and an abstract
a week before the paper submission deadline (see below).
As with the previous editions, the accepted regular papers of LPAR'08
will be published in Springer-Verlag's Lecture Notes in
Computer Science series. They will be available at the conference.
Programme Committe Chairs
-------------------------
* Iliano Cervesato (Carnegie Mellon University, Qatar)
* Helmut Veith (Technische Universit=E4t Darmstadt, Germany)
* Andrei Voronkov (University of Manchester, UK)
Participation
-------------
Authors of accepted papers are required to ensure that at least one of
them will be present at the conference. Papers that do not adhere to
this policy will be removed from the proceedings.
Important Dates
---------------
Abstract submission deadline: 26 May 2008
Paper submission deadline: 06 June 2008
Notification of acceptance: 29 August 2008
Camera-ready papers: 19 September 2008
LPAR'08 Workshops: 22 November 2008
LPAR 2008: 23-27 November 2008
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
Greetings,
I am wondering if it is possible, in the SVN version of Ciao, to
enable the occurs check in unification? i know there is the
"unify_with_occurs_check" predicate as part of the "iso_misc" module,
but i was wondering if there might be a directive or flag that could
be set, as well. I'm doing some work with a different unification
algorithm (higher order unification) and need to "level the playing
field" for some performance tests.
thanks,
juan chanco
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
This message is in MIME format. The first part should be readable text,
while the remaining parts are likely unreadable without MIME-aware tools.
--1686784523-1593107903-1206952564=:4950
Content-Type: TEXT/PLAIN; CHARSET=ISO-8859-1
Content-Transfer-Encoding: QUOTED-PRINTABLE
Content-ID: <Pine.LNX.4.64.0803311036121.4950(a)clip.dia.fi.upm.es>
=2E...............................................................
ACM PPDP 2008 - Last Call For Papers
10th ACM-SIGPLAN International Symposium on
Principles and Practice of Declarative Programming
Valencia, Spain, July 15-17, 2008
http://www.clip.dia.fi.upm.es/Conferences/PPDP08
=2E...............................................................
IMPORTANT DATES
Submission: April 10, 2008
Notification: May 15, 2008
Conference: July 15-17, 2008
SCOPE: PPDP 2008 is a forum for researchers and practitioners in the
declarative programming communities. It solicits papers on all aspects
of logic, constraint and functional programming, as well as on related
paradigms such as visual programming, executable specification
languages, database languages, AI and knowledge representation
languages for the "semantic web".
MAIN TOPICS: Logic, Constraint, and Functional Programming; Database,
AI and Knowledge Representation Languages; Visual Programming;
Executable Specification for Languages; Applications of Declarative
Programming; Methodologies for Program Design and Development;
Declarative Aspects of Object-Oriented Programming; Concurrent
Extensions to Declarative Languages; Declarative Mobile Computing;
Paradigm Integration; Proof Theoretic and Semantic Foundations; Type
and Module Systems; Program Analysis and Verification; Program
Transformation; Abstract Machines and Compilation; Programming
Environments.
PROCEEDINGS: The proceedings will be published by ACM Press
RELATED EVENTS: PPDP 2008 will be co-located with the 15th
International Static Analysis Symposium (SAS 2008) and the 18th
International Symposium on Logic-Based Program Synthesis and
Transformation (LOPSTR 2008).
SYMPOSIUM CHAIR: Elvira Albert, Complutense University of Madrid
PROGRAM CHAIR: Sergio Antoy, Portland State University
INVITED SPEAKER: Michael Leuschel, University of D=C3=BCsseldorf, Germany
PROGRAM COMMITTEE:
Elvira Albert Complutense University of Madrid, Spain
Sergio Antoy Portland State University, USA
Maribel Fernandez King's College London, UK
Maurizio Gabbrielli University of Bologna, Italy
Neil Ghani University of Nottingham, UK
Masami Hagiya University of Tokyo, Japan
Joxan Jaffar National University, Singapore
Claude Kirchner INRIA Bordeaux, France
Herbert Kuchen University of Muenster, Germany
Michael Maher NICTA and University of New South Wales, Australia
Dale Miller INRIA Saclay, France
Eugenio Moggi University of Genova, Italy
Kostis Sagonas Uppsala University, Sweden
Carsten Schurmann, IT University of Copenhagen, Denmark
Peter Sestoft IT University of Copenhagen, Denmark
LOCAL CHAIR: Christophe Joubert
SYMPOSIUM VENUE: The conference will be held at the Technical
University of Valencia, Spain.
--1686784523-1593107903-1206952564=:4950--
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
[[[ Apologies for multiple copies of this message ]]]
Doctoral Student Positions Available
Design and Verification of Embedded Software
Embedded System Research Unit
Fondazione Bruno Kessler
(formerly part of IRST - Centro per la Ricerca Scientifica e
Tecnologica)
Trento, Italy
Deadlines: May 31, 2008
The Embedded System Research Unit (http://es.fbk.eu) of the Bruno
Kessler Foundation, Trento, Italy, is seeking several candidates for Ph.D
positions.
The Ph.D. studies will be held at the International Doctorate School
in Information and Communication Technologies
(http://www.ict.unitn.it/) of the University of Trento, Italy.
The research activity will be carried out within the Embedded Systems
Unit of the Center for Scientific and Technological Research of the
Fondazione Bruno Kessler.
The research activity will aim at techniques, methodologies and support
tools for the design and verification of embedded systems. In
particular, possible topics will include:
- Embedded Software Design and Verification
- Formal Requirements Analysis
- Design and Verification of Hybrid and Timed systems
The selected candidates will be initially enrolled in a stage and, if
they pass the selection of the Ph.D. school, they will be enrolled as
Ph.D. students. Ph.D. courses will start in Autumn 2008, and the
thesis must be completed in three or four years. People enrolled in a
stage and subsequent Ph.D. courses are expected to move to Trento, and
will receive monetary support during both phases of their activity.
Candidate Profile
=================
The ideal candidate should have an MS or equivalent degree in computer
science, mathematics or electronic engineering, and combine solid
theoretical background and software development skills.
The candidate should be able to work in a collaborative environment,
with a strong commitment to reaching research excellence and achieving
assigned objectives.
Background knowledge and/or previous experience in the following
areas, though not mandatory, will be considered favorably:
- Symbolic Model Checking,
- Propositional Satisfiability,
- Satisfiability Modulo Theory,
- Constraint Solving and Optimization,
- Formal Requirements Analysis,
- Software Verification,
- Software Synthesis,
- Embedded System Design Languages (e.g. Verilog, VHDL, System C, and
System Verilog),
- Safety Analysis (FTA, FMEA).
Applications and Inquiries
==========================
Interested candidates should inquire for further information and/or
apply by sending email to <jobs[at]fbk[dot]eu>.
Applications should contain a statement of interest, with a Curriculum
Vitae, and three reference persons. PDF format is strongly encouraged.
Emails will be automatically processed and should have
'RIF: ES/phd'
as subject.
The Embedded System Research Unit
=================================
The Embedded Systems Unit consists of about 15 persons, including
researchers, post-Doc, Ph.D. students, and programmers. The
Unit carries out research, tool development and technology transfer in
the fields of design and verification of embedded systems.
Current research directions include:
* Satisfiability Modulo Theory, and its application to the
verification of hardware, embedded critical software, and hybrid
systems (Verilog, SystemC, C/C++, StateFlow/Simulink)
* Formal Requirements Analysis based on techniques for temporal logics
(consistency checking, vacuity detection, input determinism,
cause-effect analysis, realizability and synthesis)
* Formal Safety Analysis, based on the integration of traditional
techniques (e.g. Fault-tree analysis, FMEA) with symbolic
verification techniques.
The unit develops and maintains several tools:
* the NuSMV symbolic model checker (http://nusmv.fbk.eu)
* the MathSAT SMT solver (http://mathsat.fbk.eu)
* the Formal Safety Analysis Platform FSAP (http://fsap.fbk.eu)
* the Requirements Analysis Tool RAT (http://rat.fbk.eu)
The unit is currently involved in several research projects, funded by
the European Union (FP VI and FP VII), the European Space Agency, the
European Railway Agency, as well as in industrial technology transfer
projects. The projects aim at applying research results to key
application domains such as space, avionics, railways, hardware design
and mobile embedded applications.
The Embedded Systems Unit is part of Fondazione Bruno Kessler,
formerly Istituto Trentino di Cultura, a public research institute of
the Autonomous Province of Trento (Italy), founded in 1976. The
institute, through its center for the scientific and technological
research, is active in the areas of Information Technology,
Microsystems, and Physical Chemistry of Surfaces and
Interfaces. Today, FBK is an internationally recognized research
institute, collaborating with industries, universities, and public and
private laboratories in Italy and abroad. The institute's applied and
basic research activities aim at resolving real-world problems, driven
by the need for technological innovation in society and industry.
Location
========
Trento is a lively town of about 100.000 inhabitants, located 130 km
south of the border between Italy and Austria. It is well known for
the beauty of its mountains and lakes, and it offers the possibility
to practice a wide range of sports. Trento enjoys a rich cultural and
historical heritage, and it is the ideal starting point for day trips
to famous towns such as Venice or Verona, as well as to enjoy great
naturalistic journeys. Detailed information about Trento and its
region can be found at http://www.trentino.to/home/index.html?_lang=en.
Contact Person
==============
* Alessandro Cimatti
mailto: <cimatti[at]fbk[dot]eu>
http://es.fbk.eu/people/cimatti
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
3rd International Compulog/ALP Summer School
on
Logic Programming and Computational 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(a)cs.nmsu.edu and ipivkina(a)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(a)cs.nmsu.edu).
Student grants
--------------
The school is free of charge for all admitted applicants.
We will also provide lunches to all participants for the
duration of the summer school.
Several different types of grants will be available to
offset partially or totally the travel and lodging costs.
IMPORTANT: Thanks to the joint support of the Computing
Research Association Committee on the Status of Women in
Computing Research and the Coalition to Diversify Computing,
we have *several full scholarships* (i.e., travel and lodging)
for *women* applicants.
Partial grants covering lodging and meals will be provided
to other selected participants who requests them.
Students who wish to request a grant should contact via
email Enrico Pontelli (epontell(a)cs.nmsu.edu) motivating the
request.
Lodging
-------
Lodging will be available at local hotels; we will also provide
a number of affordable accomodations on the NMSU campus.
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
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
Hi Amoss,
yes, it is in the "atom2term" library:
> Ciao 1.13.0-9437: Sun Mar 2 20:25:48 CET 2008
> ?- use_module(library(atom2term)).
>
> yes
> ?- atom_codes(_A,"f(g(a))"), atom2term(_A,Term).
>
> Term = f(g(a)) ?
>
> yes
> ?-
The implementation (as stated in the manual --see the documentation
for the atom2term module listing) is partial (e.g., no ops, etc.) but
should be fine for most uses. If the full functionality is needed it
is better to call the reader (through a file or socket). We do have
plans to eventually make it possible for the reader to read directly
from a string.
Manuel H
--
----------------------- The Ciao System Development Team --------------------
The CLIP Group | Technical University of Madrid
ciao(a)clip.dia.fi.upm.es | University of New Mexico
http://www.cliplab.org / http://www.ciaohome.org
-----------------------------------------------------------------------------
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------
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.
==============================================================================
Message: Address: Action:
help majordomo(a)clip.dia.fi.upm.es Info. on useful commands
subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list
unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list
<whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list
-----------------------------------------------------------------------------
Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/
-----------------------------------------------------------------------------