Hi.
I've this program, but it does not work as expected.
> :- module(clpq_howto, _, [clpq]).
> :- use_module(library(write),[write/1]).
>
> compare(X, Y) :-
> write(X),
> write(' = '),
> write(Y),
> X .=. Y.
>
> test :- Z .=. 0.25, compare(0.25, Z).
I run it:
> ?- test.
> 0.25 = rat(1,4)
> no
> ?-
And the reply is no. I've seen
> convert(rat(X,Y), Z) :-
> Z is X/Y.
But if I ask convert(X, 0.25) it fails too.
How should I write it? Thanks.
Regards,
Victor.
==============================================================================
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/
-----------------------------------------------------------------------------
**********************************************************************
International Conference on Logic Programming
Fourth Doctoral Consortium
Udine, Italy
December 9-13, 2008
http://www.cs.kuleuven.be/~toms/DC2008/
-----------
The 2008 ICLP Doctoral Consortium (DC) is the fourth international
doctoral consortium to be offered as part of the International
Conference on Logic Programming. The DC will take place during ICLP
2008 in Udine, Italy. The Doctoral Consortium is designed for
doctoral students working in areas related to logic programming, as
well as Master's students interested in pursuing doctoral degrees in
the field of logic programming.
The Doctoral Consortium aims to provide students with an opportunity
to present and discuss their research directions and to obtain
feedback from peers as well as world-renowned experts in the field.
The Doctoral Consortium will also offer invited speakers and panel
discussions.
------------
The Doctoral Consortium is held the during the regular activities of
the ICLP 2008 Conference. The aims of the Doctoral Consortium are:
* To provide doctoral students working in the field of logic and
constraint programming with a friendly and open forum to present
their research ideas, listen to ongoing work from peer students,
and receive constructive feedback
* To provide students with relevant information about important
issues for doctoral candidates and future academics
* To develop a supportive community of scholars and a spirit of
collaborative research.
* To support a new generation of researchers with information and
advice on academic, research, industrial, and non-traditional
career paths.
The Consortium is designed for students currently enrolled in a Ph.D.
program, though we are also open to exceptions (e.g., students
currently in a Masters program and interested in doctoral studies).
Students at any stage in their doctoral studies are encouraged to
apply. Applicants are expected to be conducting
research in the field of Logic Programming; topics of interest include
(but are not limited to):
* Theoretical Foundations of Logic and Constraint Logic Programming
* Sequential and Parallel Implementation Technology
* Static and Dynamic Analysis, Abstract Interpretation, Compilation
Technology, Verification
* Logic-based Paradigms (e.g., Answer Set Programming, Concurrent
Logic Programming, Inductive Logic Programming)
* Innovative Applications of Logic Programming
The Consortium allows participants to interact with established
researchers and with other students, through presentations, question-
answer sessions, panel discussions, and invited presentations. The
Doctoral Consortium will provide the possibility to reflect - through
short activities, information sessions, and discussions - on the
process and lessons of research and life in academia. Each participant
will give a short, critiqued, research presentation.
The Doctoral Consortium will be held on a date to be determined, in
parallel with the regular activities of the ICLP 2008 conference; the
ICLP conference will run from December 9th to December 9th, 2008.
Doctoral Consortium participants will be offered the opportunity to
have their abstracts published in the ICLP 2008 conference
proceedings.
Discussants:
Several renowned faculty members and researchers in the field of Logic
Programming will join in evaluating the submission packets and will
participate in the Doctoral Consortium, providing feedback to the
presenters. The list of the discussants will be published at a later
date.
--------
Detailed submission instructions can be found in the ICLP 2008
Doctoral Consortium web site, at:
http://www.cs.kuleuven.be/~toms/DC2008/
--------
Important Dates
Submission Deadline: August 25, 2008 (strict)
Acceptance Notification: September 5, 2008
Last Date to Update
Research Summary: September 15, 2008 (strict)
Doctoral Consortium: December 9-13, 2008 (TBA)
ICLP 2008 Conference: December 9-13, 2008
------------
Doctoral Consortium Chairs:
David S. Warren Tom Schrijvers
Department of Computer Science Departement of Computer Science
State University of New York Catholic University of Leuven
Stony Brook, NY, USA Leuven, Belgium
warren _a_t_ cs.sunysb.edu tom.schrijvers _a_t_ cs.kuleuven.be
==============================================================================
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/
-----------------------------------------------------------------------------
Which version you're using ? here is an example that show work:
-------------------
:- module(_,_).
:- use_package(clpq).
test(A,B,C) :-
clp_meta([A.>.B]),
clp_meta([B.>.C]).
--------------------
?- test(A,B,C).
B.>.C,
B.<.A ?
On Tue, Jun 10, 2008 at 8:12 PM, Hannes Strass
<hannes.strass(a)alumnos.upm.es> wrote:
> Hi Samir,
>
> many thanks for the quick reply.
>
> However, my Ciao complains that "clp_meta/1" is undefined, both for
> clpq and clpr.
> Do I have to include any more libraries?
> I also did not find any mention of "clp_meta" via grep anywhere in the
> ciao directory. I have Ciao Prolog 1.10 #8.
>
> Best regards,
> Hannes.
>
> 2008/6/10 Samir Genaim <genaim(a)gmail.com>:
>> Hi Hannes,
>>
>> The solution you sent does not work since in ciao a compile time
>> transformation is applied on constraints when they appear as atoms. In
>> order to post clpq/r constraints dynamically you can use the predicate
>> clp_meta/1, e.g
>>
>> ?- clp_meta([A .>. B, B .>. C]).
>>
>>
>> Regards,
>>
>> --
>> Samir
>>
>>
>>> ---------- Forwarded message ----------
>>> From: "Hannes Strass" <hannes.strass(a)alumnos.upm.es>
>>> To: ciao-users(a)clip.dia.fi.upm.es
>>> Date: Tue, 10 Jun 2008 10:50:32 +0200
>>> Subject: mime-version:content-type:content-transfer-encoding
>>>
>>>
>>> Hi,
>>>
>>> I am working on a problem where I automatically create a linear
>>> programming problem that I want Ciao to solve (via clpr or clpq).
>>> The problem is represented as a list of inequations that I translate
>>> to constraints at runtime.
>>>
>>> Now posting a constraint as simple as "A .<. B + C" fails when created
>>> on-line, while the hard-coded variant works perfectly. I thus assume
>>> that clpr/clpq do not lack the capacity to solve it, it is just the
>>> way it is posted.
>>>
>>> Here is an example:
>>> Giving the list of "constraints"
>>>
>>> %
>>> [ leq(0, A), leq(A, 1), leq(A, B+C), flt(A), flt(B), flt(C) ]
>>> %
>>>
>>> to the predicate
>>>
>>> %
>>> post_constraints([], V) :-
>>> write('Solution:'),
>>> nl,
>>> write(V).
>>> post_constraints([ flt(E) | T], V) :-
>>> flt(E),
>>> post_constraints(T, V).
>>> post_constraints([ leq(L, R) | T], V) :-
>>> L .=<. R,
>>> post_constraints(T, V).
>>> %
>>>
>>> results in failure.
>>>
>>> Any ideas how to resolve this?
>>>
>>>
>>> Thanks,
>>> Hannes Strass.
>>>
>>>
>>>
>>>
>>> ==============================================================================
>>> 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/
>>> -----------------------------------------------------------------------------
>>>
>>>
>>> --
>>> -------------------------------------------------------------------------------
>>> Manuel Hermenegildo | Prof., C.S. Department
>>> Director, IMDEA-Software and CLIP Group | T.U. of Madrid (UPM)
>>> http://www.cliplab.org/herme | +34-91-336-7435 (W) -352-4819 (Fax)
>>> -------------------------------------------------------------------------------
>>>
>>>
>>
>>
>>
>> --
>> Samir
>>
>>
>
>
>
> --
> http://picasaweb.google.com/hannes.strass/Madrid
>
--
Samir
==============================================================================
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 Hannes,
The solution you sent does not work since in ciao a compile time
transformation is applied on constraints when they appear as atoms. In
order to post clpq/r constraints dynamically you can use the predicate
clp_meta/1, e.g
?- clp_meta([A .>. B, B .>. C]).
Regards,
--
Samir
> ---------- Forwarded message ----------
> From: "Hannes Strass" <hannes.strass(a)alumnos.upm.es>
> To: ciao-users(a)clip.dia.fi.upm.es
> Date: Tue, 10 Jun 2008 10:50:32 +0200
> Subject: mime-version:content-type:content-transfer-encoding
>
>
> Hi,
>
> I am working on a problem where I automatically create a linear
> programming problem that I want Ciao to solve (via clpr or clpq).
> The problem is represented as a list of inequations that I translate
> to constraints at runtime.
>
> Now posting a constraint as simple as "A .<. B + C" fails when created
> on-line, while the hard-coded variant works perfectly. I thus assume
> that clpr/clpq do not lack the capacity to solve it, it is just the
> way it is posted.
>
> Here is an example:
> Giving the list of "constraints"
>
> %
> [ leq(0, A), leq(A, 1), leq(A, B+C), flt(A), flt(B), flt(C) ]
> %
>
> to the predicate
>
> %
> post_constraints([], V) :-
> write('Solution:'),
> nl,
> write(V).
> post_constraints([ flt(E) | T], V) :-
> flt(E),
> post_constraints(T, V).
> post_constraints([ leq(L, R) | T], V) :-
> L .=<. R,
> post_constraints(T, V).
> %
>
> results in failure.
>
> Any ideas how to resolve this?
>
>
> Thanks,
> Hannes Strass.
>
>
>
>
> ==============================================================================
> 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/
> -----------------------------------------------------------------------------
>
>
> --
> -------------------------------------------------------------------------------
> Manuel Hermenegildo | Prof., C.S. Department
> Director, IMDEA-Software and CLIP Group | T.U. of Madrid (UPM)
> http://www.cliplab.org/herme | +34-91-336-7435 (W) -352-4819 (Fax)
> -------------------------------------------------------------------------------
>
>
--
Samir
==============================================================================
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,
I am working on a problem where I automatically create a linear
programming problem that I want Ciao to solve (via clpr or clpq).
The problem is represented as a list of inequations that I translate
to constraints at runtime.
Now posting a constraint as simple as "A .<. B + C" fails when created
on-line, while the hard-coded variant works perfectly. I thus assume
that clpr/clpq do not lack the capacity to solve it, it is just the
way it is posted.
Here is an example:
Giving the list of "constraints"
%
[ leq(0, A), leq(A, 1), leq(A, B+C), flt(A), flt(B), flt(C) ]
%
to the predicate
%
post_constraints([], V) :-
write('Solution:'),
nl,
write(V).
post_constraints([ flt(E) | T], V) :-
flt(E),
post_constraints(T, V).
post_constraints([ leq(L, R) | T], V) :-
L .=<. R,
post_constraints(T, V).
%
results in failure.
Any ideas how to resolve this?
Thanks,
Hannes Strass.
==============================================================================
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
ICLP'08
*** EXTENDED DEADLINES ***
24th International Conference on Logic Programming
Udine, Italy, December 9th-13th, 2008
http://iclp08.dimi.uniud.it
CONFERENCE SCOPE
----------------
Since the first conference held in Marseilles in 1982, ICLP has been the
premier international conference for presenting research in logic programming.
Contributions (techical papers, application papers, and posters) are sought in
all areas of logic programming including but not restricted to:
* Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning,
Knowledge Representation.
* Implementation: Compilation, Memory Management, Virtual Machines, Parallelism.
* Environments: Program Analysis, Program Transformation, Validation and
Verification, Debugging, Profiling, Integration.
* Language Issues: Extensions, Integration with Other Paradigms, Concurrency,
Modularity, Objects, Coordination, Mobility, Higher Order, Types, Modes,
Programming Techniques.
* Related Paradigms: Abductive Logic Programming, Inductive Logic Programming,
Constraint Logic Programming, Answer-Set Programming.
* Applications: Databases, Data Integration and Federation, Software
Engineering, Natural Language Processing, Web and Semantic Web, Agents,
Artificial Intelligence, Bioinformatics
The three broad categories for submissions are:
(1) Technical papers, providing novel research contributions, innovative
perspectives on the field, and/or novel integrations across different
areas;
(2) Application papers, describing innovative uses of logic programming
technology in real-world application domains;
(3) Posters, ideal for presenting and discussing current work, not yet ready
for publication, for PhD thesis summaries and research project overviews.
A separate session dedicated to the celebration of the 20th anniversary of
stable model semantics will also be part of the program.
Accepted papers and posters will be allocated time for presentation during the
conference (with posters having a considerably shorter time). At least one
author of each accepted submission is expected to register and participate in
the event.
In addition to papers and posters, the technical program will include invited
talks, advanced tutorials, specialized sessions, workshops, and a Doctoral
Student Consortium. Details, as they become available will be posted at:
http://iclp08.dimi.uniud.it
PAPERS AND POSTERS
------------------
Papers and posters must describe original, previously unpublished research, and
must not be simultaneously submitted for publication elsewhere. Emphasis will
be placed on the novelty and innovative nature of the results (even if not
completely polished and refined).
All submissions will be peer-reviewed by an international panel. Submissions
MUST contain substantial original, unpublished material.
All submissions must be written in English. Technical papers and application
papers must not exceed 15 pages in the Springer LNCS format
(see http://www.springeronline.com/lncs/)
The limit for posters is 5 pages in the same format.
The primary means of submission will be electronic, through the Easychair
submission system. The submission page is available at
http://www.easychair.org/conferences/?conf=ICLP08
APPLICATION PAPERS
------------------
Within the scope of the general call for papers for the upcoming 24th
International Conference on Logic Programming, we would like to draw the
attention of researchers and practitioners on the opportunity to submit
manuscripts to the Application Track of the conference.
Application papers, are expected to describing complex and/or real-world
applications that rely in an essential manner on the use of logic programming
technology. Description of innovative applications as well as engineering
solutions leveraging logic programming technology are solicited.
Papers must describe original, previously unpublished results, and must not be
simultaneously submitted for publication elsewhere.
Submissions MUST contain substantial original, unpublished material. All
submissions must be written in English. Application papers should be structured
to emphasize:
* the application domain, in terms understandable by a layman
* the specific problem addressed within the application domain,
stressing importance and complexity
* a clear discussion of the unique need for logic programming technology
to address the problem
* a clear description of the application developed and its evaluation.
PUBLICATION
-----------
The proceedings of the conference will be published by Springer-Verlag in the
LNCS series. All accepted papers and posters will be included in the
proceedings.
WORKSHOPS
---------
The ICLP'08 program will include several workshops. They are perhaps the best
place for the presentation of preliminary work, novel ideas, and new open
problems to a more focused and specialized audience. Workshops also provide a
venue for presenting specialised topics and opportunities for intensive
discussions and project collaboration in any areas related to logic
programming, including cross-disciplinary areas.
DOCTORAL CONSORTIUM
-------------------
The Doctoral Consortium (DC) on Logic Programming is the 4th Doctoral
consortium to provide doctoral students with the opportunity to present and
discuss their research directions, and to obtain feedback from both peers and
word-renown experts in the field. The DC will also offer invited speakers and
panel discussions. Accepted participants will receive partial financial support
to attend the event and the main conference. The best paper and presentation
from the DC will be given the opportunity to present in special session of the
main ICLP conference.
CELEBRATING 20th YEARS OF STABLE MODEL SEMANTICS
------------------------------------------------
The year 2008 marks the 20th anniversary of the publication that introduced the
stable model semantics for logic programs with negation. The paper titled "The
stable semantics for logic programs" by Michael Gelfond and Vladimir Lifschitz
was presented at ICLP-1988. It was a momentous event that gave rise to a
vibrant subfield of logic programming known now as the answer-set programming.
Its distinguishing aspects are close connections to the fields of knowledge
representation, satisfiability and constraint satisfaction, ever faster
computational tools, and a growing list of successful applications.
To celebrate the stable-model semantics, there will be a special session at
ICLP 2008 dedicated to answer-set programming. The session will feature talks
by Michael Gelfond and Vladimir Lifschitz. as well as by other major
contributions to the field, presenting personal perspectives on the
stable-model semantics, its impact and its future. There will be a panel
discussion, and regular accepted ICLP papers falling into the answer-set
programming area will complete the program.
CONFERENCE VENUE
----------------
The conference will be held in the city of Udine, the capital of the historical
region of Friuli, Italy. Located between the Adriatic sea and the Alps, close
to Venice, Austria and Slovenia, Udine is a city of Roman origins, funded by
Emperor Otto in 983. Rich of historical sites, Udine is also famous for its
commercial and shopping opportunities and its outstanding wine and culinary
traditions.
SUPPORT SPONSORING AND AWARDS
-----------------------------
The conference is sponsored by the Association for Logic Programming (ALP). The
ALP has funds to assist financially disadvantaged participants. The ALP is
planning to sponsor two awards for ICLP 2008: for the best technical paper and
for the best student paper.
IMPORTANT DATES
--------------- Papers Posters
Abstract submission deadline June 6th n/a
Submission deadline June 13th 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
ICLP'2008 ORGANIZATION
----------------------
General Chair:
Agostino Dovier (University of Udine)
Program Co-Chairs:
Maria Garcia de la Banda (Monash University)
Enrico Pontelli (New Mexico State University)
Workshop Chair:
Tran Cao Son (New Mexico State University)
Doctoral Student Consortium:
David Warren (SUNY Stony Brook)
Tom Schrijvers (K.U.Leuven)
Publicity Co-Chairs:
Marcello Balduccini (Kodak Research Labs)
Alessandro Dal Palu' (University of Parma)
Programming Competition Chair:
Bart Demoen (K.U.Leuven)
20 Years of Stable Models:
Mirek Truszczynski (University of Kentucky)
Andrea Formisano (University of Perugia)
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
Web Master:
Raffaele Cipriano
Local Arrangements Committee:
Alberto Casagrande
Elisabetta De Maria
Luca Di Gaspero
Carla Piazza
----------------------------------------------------
For further information: iclp08(a)cs.nmsu.eduhttp://iclp08.dimi.uniud.it
==============================================================================
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/
-----------------------------------------------------------------------------