Hi,
I am using the finite domain (FD) constraint solving library of
Ciao Prolog 1.10#5. I am
trying to solve a system of 10 equations (code directly adapted
from GNU Prolog - I attach the Ciao code below). If I use the FD
constraint library of SICSTus as well GNU Prolog I correctly obtain the
answer
[6,0,8,4,9,3,9].
However, if I use the FD constraint library of Ciao Prolog,
I receive a 'no' answer (indicating that this system has no
solution).
My code in Ciao Prolog for this benchmark is quite similar to that
provided
in the file crypta.pl (that is an example file provided in the
distribution
of the Ciao system).
Is my code incorrect? If the answer is 'no', then, is the unexpected
answer due to a limitation of the FD constraint library?
thanks in advance for your attention,
best regards,
Antonio
================================================
*-------------------------------------------------------------------------*/
/* Benchmark (Finite Domain)
*/
/*
*/
/* Name : eq10.pl
*/
/* Title : linear equations
*/
/* Original Source: Thomson LCR
*/
/* Adapted to GNU Prolog by : Daniel Diaz log
*/
/* Date : September 1992
*/
/*
*/
/* Adapted to Ciao Prolog by : Antonio J. Fernández (Málaga University)
*/
/* Date : July 2005
*/
/*
*/
/*
*/
/* A system involving 7 variables and 10 equations
*/
/*
*/
/* Solution:
*/
/* [X1,X2,X3,X4,X5,X6,X7]
*/
/* [ 6, 0, 8, 4, 9, 3, 9]
*/
/*-------------------------------------------------------------------------*/
:- use_package(fd).
:- use_module(library(prolog_sys), [statistics/2]).
:- use_module(library(format)).
q(Ls) :-
statistics(runtime,_),
eq10(Ls),
statistics(runtime,[_, Time]),
format("Used ~d milliseconds~n", Time).
eq10(LD):-
LD = [X1,X2,X3,X4,X5,X6,X7],
LD in 0..10,
0+98527*X1+34588*X2+5872*X3+59422*X5+65159*X7
.=. 1547604+30704*X4+29649*X6,
0+98957*X2+83634*X3+69966*X4+62038*X5+37164*X6+85413*X7
.=. 1823553+93989*X1,
900032+10949*X1+77761*X2+67052*X5
.=. 0+80197*X3+61944*X4+92964*X6+44550*X7,
0+73947*X1+84391*X3+81310*X5
.=. 1164380+96253*X2+44247*X4+70582*X6+33054*X7,
0+13057*X3+42253*X4+77527*X5+96552*X7
.=. 1185471+60152*X1+21103*X2+97932*X6,
1394152+66920*X1+55679*X4
.=. 0+64234*X2+65337*X3+45581*X5+67707*X6+98038*X7,
0+68550*X1+27886*X2+31716*X3+73597*X4+38835*X7
.=. 279091+88963*X5+76391*X6,
0+76132*X2+71860*X3+22770*X4+68211*X5+78587*X6
.=. 480923+48224*X1+82817*X7,
519878+94198*X2+87234*X3+37498*X4
.=. 0+71583*X1+25728*X5+25495*X6+70023*X7,
361921+78693*X1+38592*X5+38478*X6
.=. 0+94129*X2+43188*X3+82528*X4+69025*X7,
labeling(LD).
--------------------------------
Webmail de SATD usando IlohaMail
==============================================================================
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 all,
I have a question. I want to load a file at runtime. See the example
below:
% file 1: pp1.pl
:- module(pp1, [m/0]).
:- use_module(library(compiler)).
m :- use_module(pp2, [test/0, s/1]),
pp2:test,
pp2:s(2),
use_module(pp3),
pp3:test,
pp3:s(3).
% file: pp2.pl
:- module(pp2, [test/0, s/1]).
test :- message(['pp2']).
s(X) :- message(['pp2:', X]).
% file: pp3.pl
:- module(pp3, [test/0, s/1]).
test :- message(['pp3']).
s(X) :- message(['pp3:', X]).
When loading pp1.pl from ciao, the following error message appears:
?- use_module(pp1).
{Compiling /cygdrive/d/pp1.pl
ERROR: Bad module qualification of test/0, predicate not imported form
module pp2
ERROR: Bad module qualification of s/1, predicate not imported form module
pp2
ERROR: Bad module qualification of test/0, predicate not imported form
module pp3
ERROR: Bad module qualification of s/1, predicate not imported form module
pp3
}
?- yes
Can anyone tell me why the above program does not work.
Respectively
Omar.
==============================================================================
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/
-----------------------------------------------------------------------------
Hello,
has anybody already tried to work with the ciao fuzzy prolog? I
think, the implication-operator doesn't work properly. In all the
examples included with the installtion of ciao, as well as in my own,
I don't get any meaningful results when I try to use the => operator.
Why is that?
I tried for example the following:
jung :# fuzzy_predicate[(0,1),(20,1),(30,0),(100,0)].
viel_schlafen :# fuzzy_predicate[(0,0),(5,0),(6,0.25),(8,1),(12,1)].
braucht(Alter,Stunden,M) :~ '=>'(min,jung(Alter,_),viel_schlafen
(Stunden,_),M).
But I never get a value for M. In the examples included it's the same
problem, ciao only tells me that M must be between 0 and 1. What's
wrong?
Greetings,
Roman
==============================================================================
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/
-----------------------------------------------------------------------------
Hello ciao users!
I have a question concerning the fuzzy prolog chapter (105.4) in the
ciao manual. It gives an example programm to determine the
possibility that i throw a five with two loaded dice. But the
program, resp. the dprod-aggregator in particular, doesn't work
correctly. The solution (which, imho, should be 0.853) isn't computed.
Another thing is, that the suggested query produces hundreds of
output lines. I'm new to prolog, so I don't know the tricks. Is there
a way to suppress duplicate output? (I certainly hope so!)
Greetings from Koblenz, Germany,
Roman
==============================================================================
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/
-----------------------------------------------------------------------------
Dear Colleague,
Please note that ICLP 2005 registration is now open. In fact, the
early registration deadline is not too far (July 31st). More details
can be found at the ICLP 2005 website:
http://www.iiia.csic.es/iclp2005/
Highlights include invited talks by Ian Horrocks, Peter Stuckey,
Francesca Rossi, a tutorial on "Inductive Logic Programmng,
Statistical Relational Learning and its applications" by Vitor Santos
Costa, contributed papers, posters, programming competition, panels,
conference workshops, and of course the Solar Eclipse that will take
place during the conference and will be visible in Barcelona (time has
been set aside during the conference to view the eclipse).
We look forward to seeing all of you in Barcelona.
Best wishes,
Gopal Gupta and Maurizio Gabbrielli
----------------------------------------------------------------------
LIST OF ACCEPTED PAPERS:
----------------------
Full papers (26 papers)
-----------------------
Use of Logic Programming for Complex Business Rules
Walter Wilson
Semantics of Framed Temporal Logic Programs
Zhenhua Duan, Xiaoxiao Yang and Maciej Koutny.
On the relation between Answer Set and SAT procedures (or, between smodels and cmodels)
Enrico Giunchiglia and Marco Maratea.
HYPROLOG: a new logic programming language with assumptions and abduction
Henning Christiansen and Veronica Dahl.
A Generator of Efficient Abstract Machine Implementations and its Application to Emulator Minimization
Jose Morales, Manuel Carro, German Puebla and Manuel Hermenegildo.
Nondeterminism Analysis of Functional Logic Programs
Bernd Brabel and Michael Hanus.
Testing for Termination with Size Change Graphs
Michael Codish, Vitaly Lagoon and Peter Stuckey.
Towards an Integration of Answer Set and Constraint Solving
Sabrina Baselice, Piero A. Bonatti and Michael Gelfond.
Symbolic Support Graph: A Space Efficient Data Structure For Incremental Tabled Evaluation
Diptikalyan Saha and C. R. Ramakrishnan.
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Hans Tompits and Stefan Woltran.
Hybrid Probabilistic Logic Programs With Non-monotonic Negation
Emad Saad and Enrico Pontelli.
Reducing Inductive Definitions to Propositional Satisfiability
Nikolay Pelov and Eugenia Ternovska.
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
Agostino Dovier, Andrea Formisano and Enrico Pontelli.
A Well-Founded Semantics with Disjunction
Joao Alcantara, Carlos Damasio and Luis Moniz Pereira.
An optimised Semantic Web query language implementation in Prolog
Jan Wielemaker.
Practical Higher-Order Pattern Unification via On-the-Fly Raising
Gopalan Nadathur and Natalie Linnell.
Dynamic Mixed-Strategy Evaluation of Tabled Logic Programs
Ricardo Rocha, Fernando Silva and Vitor Santos Costa.
Small proof witnesses for LF
Susmit Sarkar, Brigitte Pientka and Karl Crary.
Guard and Continuation Optimization for Occurrence Representations of CHR
Jon Sneyers, Tom Schrijvers and Bart Demoen.
Abduction of Linear Arithmetic Constraints
Michael Maher.
Coordination of Many Agents
Joxan Jaffar, Roland Yap and Kenny Zhu.
Parallelizing Union-Find in Constraint Handling Rules Using Confluence
Thom Fruehwirth.
Luca Bortolussi and Herbert Wiklicky.
A Distributed and Probabilistic Concurrent Constraint Programming Language
Deductive Multi-valued Model Checking
Ajay Mallya.
Techniques for Scaling Up Analyses Based on Pre-Interpretations
John P. Gallagher, Kim Henriksen and Gourinath Banda.
Polynomial Interpretations as a Basis for Termination An
Manh Thang Nguyen and Danny De Schreye.
-----------------------------
Accepted posters (18 posters)
-----------------------------
Inconsistency-based Strategy For Clarifying Vague Software Requirements
Kedian Mu, Zhi Jin and Ruqian Lu.
A Type System for CHR
Emmanuel Coquery and Francois Fages.
Decision Support for Personalization on Mobile Devices
Thomas Kleemann and Alex Sinner.
Algorithms for FO(ID) model generation
Maarten Marikn, Rudradeb Mitra and Marc Denecker.
Abstract Interpretation with Specialized Definitions
German Puebla, Elvira Albert and Manuel Hermenegildo.
Induction of causal ramifications for action descriptions in ASP
Ramon Otero.
The need for Ancestor Resolution when answering queries in Horn Clause Logic
Oliver Ray.
Modeling Systems in CLP with Coinductive Tabling
Joxan Jaffar, Andrew Edward Santosa and Razvan Voicu.
A Sufficient Condition for Strong Equivalence under the Well-Founded Semantics
Chistos Nomikos, Panos Rondogiannis and William Wadge.
Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. Summary
Tom Schrijvers.
IMPACT: Innovative Models for Prolog with Advanced Control and Tabling
Ricardo Rocha, Ricardo Lopes, Fernando Silva and Vitor Santos Costa.
Using CLP to characterise linguistic lattice boundaries in a text mining process
Alexandre Saidi.
Hybridization of Genetic Algorithms and Constraint Propagation for the BACP
Tony Lambert, Carlos Castro, Eric Monfroy, Maria Cristina Riff and Fridiric Saubion.
The MYDDAS Project: Using a Deductive Database for Traffic Characterization
Michel Ferreira.
Open World Reasoning in Datalog
Gergely Lukacsy and Zsolt Nagy.
Optimizing Queries for Heterogeneous Information Sources
Andras Gyvrgy Bikis.
Denotational semantics using Horn Concurrent Transaction Logic
Marcus Santos.
Gentra4cp: a Generic Trace Format for Constraint Programming
Ludovic Langevine and The OADymPPaC team.
==============================================================================
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/
-----------------------------------------------------------------------------
-----------------------------------------------------------------------------
CALL FOR PAPERS!!!
Eighth International Symposium on
Practical Aspects of Declarative Languages 2006
(PADL '06)
http://www.cs.brown.edu/people/pvh/PADL06.html
Charleston Place Hotel
Charleston, South Carolina
January 9-10
Co-located with ACM POPL'06
Declarative languages build on sound theoretical bases to provide
attractive frameworks for application development. These languages
have been successfully applied to vastly different real-world
situations, ranging from data base management to active networks to
software engineering to decision support systems.
New developments in theory and implementation have opened up new
application areas. At the same time, applications of declarative
languages to novel problems raises numerous interesting research
issues. Well-known questions include designing for scalability,
language extensions for application deployment, and programming
environments. Thus, applications drive the progress in the theory and
implementation of declarative systems, and benefit from this progress
as well.
PADL is a forum for researchers and practioners to present original
work emphasizing novel applications and implementation techniques for
all forms of declarative concepts, including, functional, logic,
constraints, etc. Topics of interest include:
* innovative applications of declarative languages;
* declarative domain-specific languages and applications;
* practical applications of theoretical results;
* new language developments & their impact on applications;
* evaluation of implementation techniques on practical applications;
* novel uses of declarative languages in the classroom; and
* practical experiences
PADL 06 welcomes new ideas and approaches pertaining to applications
and implementation of declarative languages, and is not limited to the
scope of the past five PADL symposia.
PADL 06 will be co-located with the ACM POPL.
IMPORTANT DATES AND SUBMISSION GUIDELINES
Paper Submission: August 20, 2005
Notification: September 30, 2005
Final Manuscript: October 20, 2005
Symposium: January 9-10, 2005
Authors should submit an electronic copy of the full paper
(written in English) in Postscript (Level 2) or PDF. Papers must be no
longer than 15 pages, written in 11-point font and with single
spacing. Since the final proceedings will be published as Lecture
Notes in Computer Science by Springer Verlag, authors are strongly
encouraged to use the LNCS paper formatting guidelines for their
submission.
Each submission must include on its first page the paper title;
authors and their affiliations; contact author's email and postal
addresses, telephone and fax numbers, abstract, and three to four
keywords. The keywords will be used to assist us in selecting
appropriate reviewers for the paper. If electronic submission is
impossible, please contact the program chair for information on how to
submit hard copies.
MOST PRACTICAL PAPER AWARD
The Most Practical Paper award will be given to the submission
that is judged by the programm committee to be the best in terms of
practicality, originality, and clarity of presentation. The program
committee may choose not to make an award; or may make multiple
awards.
PROGRAM COMMITTEE:
Kenichi Asai Ochanomizu University, Japan
Daniel Damien BRICS, Denmark
Mireille Ducasse IRISA/INSA of Rennes, France
Matthew Flatt University of Utah, US
Gopal Gupta University at Texas at Dallas, US
Manuel Hermenegildo UP Madrid, Spain
Paul Hudak Yale University, US
Narendra Jusien Ecole des Mines de Nantes, France
Laurent Michel University of Connecticut, US
Enrico Pontelli New Mexico State University
Gopalan Nadathur U. of Minnesota, US
Vitor Santos-Costa U. Federal do Rio de Janeiro, Brazil
Christian Schulte Royal Institute of Technology, Sweden
Peter Stuckey U. of Melbourne, Australia
Pascal Van Hentenryck Brown University, US
Peter van Roy U. of Louvain, Belgium
David S. Warren SUNY at Stony Brook, US
Roland Yap National U. of Singapore, Singapore
Contacts:
For information about papers and submissions, please contact the
Program Chair:
Pascal van Hentenryck
PC Chair - PADL 2006
Department of Computer Science
Brown University
Providence, RI, U.S.A.
Email: pvh(a)cs.brown.edu
For other information about the conference and the summer school,
please contact:
Gopal Gupta
Department of Computer Science
University at Texas at Dallas
Dallas, TX, U.S.A.
Email: gupta(a)utdallas.edu
Sponsored by COMPULOG Americas (http://www.cs.nmsu.edu/~complog).
==============================================================================
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 ]]]
--------------------------------------------------------------------
Young Researcher Position available on the
ISAAC Project
at ITC-IRST, Trento, Italy
--------------------------------------------------------------------
The Automated Reasoning Systems Division (SRA) at ITC-irst
(http://sra.itc.it/) is seeking a young researcher to join the team of
the ISAAC project. The position lasts up to January 2007 and is
already open. Monthly salaries vary depending on age, qualification,
and experience.
The ISAAC Project
==================
The ISAAC project (AST3-CT-2003-501848, see http://www.cert.fr/isaac/)
-- Improvement of Safety Activities on Aeronautical Complex Systems --
is a Specific Targeted Research Project sponsored by the European
Commission under the 6th Framework Program. The ISAAC consortium
comprises aeronautical industries (Alenia Aeronautica, Airbus France,
Airbus UK, Airbus Germany, Saab AB, Societa' Italiana Avionica,
Dassault Aviation) and research centers leaders in formal
verification, safety assessment, and tool development (ITC-irst, ONERA
CERT, Kuratorium OFFIS e. V., Prover Technology AB).
The goal of the ISAAC project is to define a methodology, based on
formal methods, to improve the safety analysis practice for complex
systems development in the aeronautic field, to set up a shared
environment based on tools supporting the methodology, and to validate
the methodology through its application to case-studies. The ISAAC
project builds upon the results of the ESACS project
(http://www.cert.fr/esacs/).
The role of ITC-irst in the project is manifold. ITC-irst is
developing the FSAP/NuSMV-SA safety analysis platform
(http://sra.itc.it/tools/FSAP/) to support the safety analysis of
complex systems. This platform is based on the following components:
FSAP (Formal Safety Analysis Platform), providing a graphical user
interface for easier user interaction, and NuSMV-SA, the core engine
providing the safety analysis capabilities, which are implemented on
top of the NuSMV model checker (http://nusmv.irst.itc.it). The
platform is being evaluated against some case-studies provided by the
industrial partners.
Description of Activity
=======================
The young researcher will be part of the ISAAC team at ITC-irst. The
activity will include, as main responsibility, the design and
implementation of new features in FSAP (Formal Safety Analysis
Platform), and the preparation of project deliverables and the
management of the FSAP/NuSMV-SA web site and the related
documentation. Further activities may include modeling of industrial
case-studies in the NuSMV language, and involvement in the
implementation of the safety analysis algorithms in NuSMV-SA.
Candidate Requirements
======================
The ideal candidate should have a Master in Computer Science,
Engineering or related areas, very good programming skills, and be
able to work in a collaborative environment, with a strong commitment
to achieving assigned objectives and reaching research excellence.
The candidate is expected to be knowledgeable of:
* Linux and Windows operating systems
* Cygwin or MinGW platforms
* C/C++ programming languages
* XML language and parser (expat library)
* standard SW maintenance and compilation tools (make, gcc,
debugger, automake/autoconf tools)
* FLTK library (http://www.fltk.org/)
Background and/or previous experiences in the areas of safety
analysis, formal verification and model checking, though not
mandatory, will be considered favourably.
Applications
============
Please send your applications via email to:
isaac-recruit(a)itc.it
using 'ISAAC Researcher: application' as subject, and including a
statement of interest and a CV. PostScript, PDF, or plain text formats
are strongly encouraged. Please use the above address also for
further inquiries.
==============================================================================
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/
-----------------------------------------------------------------------------
================ DEADLINE EXTENSION: JULY 10! ===============
LAST CALL FOR PAPERS
MoVeLog'05
Mobile Code Safety and Program Verification
Using Computational Logic Tools
An ICLP Workshop, Sitges, Spain, Oct. 5, 2005
http://babel.ls.fi.upm.es/movelog05
Computational logic and logic programming in particular can support
rich reasoning about programs, proofs, types, and specifications.
Recent breakthroughs in mobile code safety and program verification
have brought even more relevance to these tools, especially in the
areas of meta-logic proof theory, proof search, static analysis and
abstract interpretation, and model checking, even when the object code
involved is very far from declarative. Components are needed that can
perform such reasoning and the logic programming community is well
positioned to provide such components.
Especially promising has been ground-breaking work with
proof-carrying-code, a development that shows signs of having
widespread applications, and has brought a surprising number of new
challenges where computational logic can potentially contribute. It is
worth pointing out that the earliest papers in the field made explicit
mention of the possible relevance of such formalisms as lambda-prolog
and ELF for all phases of the enterprise: generation of verification
conditions, formalization of proofs, manipulation of proofs and
certificate checking. Since then there have been proposals to combine
these approaches with other logic programming frameworks equipped with
tools for static analysis and abstract interpretation. While other
programming paradigms may also be relevant here, logic programming may
have an important edge among other reasons because its basis in
declarative principles has led to the development of sophisticated
static analysis and abstract interpretation tools."
This workshop is aimed at using computational logic in general and
logic programming in particular to support dealing with security,
safety, correctness, and mobile code. It aims to bring together
researchers in logic programming working in mobile code safety,
security, program analysis, and correctness as well as those in
related areas of automated deduction (HOL, COQ, NuPRL, ISABELLE etc).
Relevant topics include (but are not limited to) the following:
- Protocol analysis and verification
- Proof Carrying Code
- Logical Frameworks
- Type Systems
- Static Analysis
- Model Checking
- Theorem Proving
- Proof Checking
- Verification Condition Generation
- Constraint Systems
- New formal systems for verification
- Algorithms and Cryptography Questions related to the above topics
Submissions:
Submitted papers must no be longer than 10 pages, to be presented in
~20 minutes. They must consist of original, relevant and previously
unpublished sound research results related to any of the topics of the
conference.
We also invite submissions of brief expositions of work in progress
for a poster session. The length of these papers should be no longer
than 4 pages.
At least one author of each paper must register for the conference
before the early registration deadline. The acceptance of the paper
implies its oral presentation at the conference.
To submit a paper, send an electronic mail to
movelog05-submissions(a)babel.ls.fi.upm.es
You should receive a confirmation mail.
If there is sufficient interest, post-workshop proceedings will be
considered.
Dates:
- Paper Submission: July 10.
- Notification of Acceptance/Rejection: July 28.
Program Committee:
Bruno Blanchet (ENS, Paris)
Gopal Gupta (Univ, of Texas, Dallas, USA)
Manuel Hermenegildo (UPM, Spain and Univ. of New Mexico, USA)
Danny Krizanc (Wesleyan University, USA)
Jim Lipton (Wesleyan University, USA)
Julio Mariño (UPM, Spain)
Dale Miller (cole Polytechnique, INRIA Futurs, France)
Gopalan Nadathur (University of Minnesota, USA)
Mike Whalen (University of Minnesota, USA)
Alwen Tiu (LORIA, Nancy, France)
Workshop Organizing Committee:
James Lipton, (program co-chair)
Wesleyan University
Alwen Tiu, (program co-chair)
LORIA, Nancy
Julio Mariño Carballo
Technical University of Madrid
Dale Miller
Laboratoire d'Informatique, LIX
Manuel Hermenegildo
Technical University of Madrid and The University of New Mexico
--
-------------------------------------------------------------------------------
herme(a)fi.upm.es | Manuel Hermenegildo
+34-91-336-7435 (Work) | Facultad de Informatica
+34-91-352-4819 or 336-7412 (FAX) | Universidad Politecnica de Madrid
http://www.clip.dia.fi.upm.es/~herme | 28660-Boadilla del Monte, MADRID SPAIN
-------------------------------------------------------------------------------
==============================================================================
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/
-----------------------------------------------------------------------------