Ciao-users

ciao-users@cliplab.org

948 discussions

Unicode
by oui 05 Nov '08

05 Nov '08

I need to manage data written in diverse alphabets like Greek, Russian, Arabic or Hindi. Can Prolog help me and what is to observe to do that? (ciao would better correspond to my view of solution of my problem because of existence of the Pillow library to realize Web applications) -- View this message in context: http://www.nabble.com/Unicode-tp20349040p20349040.html Sent from the Ciao Prolog - Users mailing list archive at Nabble.com. ============================================================================== 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/ -----------------------------------------------------------------------------

1 0

BYTECODE09: 2nd Call for Papers
by Samir Genaim 16 Oct '08

16 Oct '08

******************************************************** * 2nd Call for Papers * * * * Fourth Workshop on Bytecode Semantics, * * Verification, Analysis and Transformation * * * * York, UK, 29th March 2009, part of ETAPS 2009 * * * * Venue: The University of York * * * * http://www.clip.dia.fi.upm.es/Conferences/BYTECODE09 * * * ******************************************************** Important Dates =============== Paper Submission December 21, 2008 Notification January 25, 2009 Final Version February 8, 2009 Workshop March 29, 2009 Workshop Description ==================== Bytecode, such as produced by e.g. .Net and Java compilers, has become an important topic of interest, both for industry and academia. The industrial interest stems from the fact that bytecode is typically used for the Internet and mobile devices (smartcards, phones, etc.), where security is a major issue. Moreover, bytecode is device-independent and allows dynamic loading of classes, which provides an extra challenge for the application of formal methods. In addition, the lack of structure of the code and the pervasive presence of the operand stack also provide extra challenges for the analysis of bytecode. This workshop will focus on the latest developments in the semantics, verification, analysis, and transformation of bytecode. Both new theoretical results and tool demonstrations are welcome. Invited Speaker =============== TBA Submission ========== There are two paper categories, Regular and Tool demo papers. Paper should be written using the ENTCS style and submitted through the easy chair page "http://www.easychair.org/conferences/?conf=bytecode09". Please indicate in the submission page the category of your submission. Submissions will be evaluated by the Program Committee for inclusion in the ENTCS proceedings. Regular research papers should be at most 15 pages (including bibliography and excluding well-marked appendices not intended for publication). They must contain original contributions, be written in English and be unpublished and not submitted simultaneously for publication elsewhere. Tool demo papers must describe a completed, robust and well-documented tool -- highlighting the overall functionality of the tool, the interfaces of the tool, interesting examples and applications of the tool, an assessment of the tool's strengths and weaknesses, and a summary of documentation/support available with the tool. The body of the paper must be no longer than 6 pages in length (including bibliography), and it should give an overview of the tool, the methodology associated with its use, a summary of how the tool has been applied and to what effect, and it should indicate what supporting artifacts (user manual, example repository, downloads, etc) are available. This material will be included in the ENTCS proceedings if the paper is accepted. In addition, the paper should include an appendix (limited to six pages) that gives an outline of the proposed demo presentation (this material will NOT appear in the ENTCS proceedings). Program Committee ================= Wolfgang Ahrendt Chalmers University of Technology, SWE Elvira Albert (co-chair) Complutense University of Madrid, ESP June Andronick NICTA, AUS David Aspinall University of Edinburgh, UK Cristina Cifuentes Sun Microsystems, AUS Samir Genaim (co-chair) Technical University of Madrid, ESP Sara Kalvala The University of Warwick, UK Gerwin Klein The University of New South Wales, AUS Francesco Logozzo Microsoft Research, USA David Pichardie INRIA Rennes (IRISA), FRA Tamara Rezk INRIA-Microsoft, FRA Fausto Spoto University of Verona, ITA Eran Yahav IBM T.J. Watson Research Center, 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/ -----------------------------------------------------------------------------

1 0

BYTECODE09: 1st Call for Papers
by Samir Genaim 06 Oct '08

06 Oct '08

******************************************************** * 1st Call for Papers * * * * Fourth Workshop on Bytecode Semantics, * * Verification, Analysis and Transformation * * * * York, UK, 29th March 2009, part of ETAPS 2009 * * * * Venue: The University of York * * * * http://www.clip.dia.fi.upm.es/Conferences/BYTECODE09 * * * ******************************************************** Important Dates =============== Paper Submission December 21, 2008 Notification January 25, 2009 Final Version February 8, 2009 Workshop March 29, 2009 Workshop Description ==================== Bytecode, such as produced by e.g. .Net and Java compilers, has become an important topic of interest, both for industry and academia. The industrial interest stems from the fact that bytecode is typically used for the Internet and mobile devices (smartcards, phones, etc.), where security is a major issue. Moreover, bytecode is device-independent and allows dynamic loading of classes, which provides an extra challenge for the application of formal methods. In addition, the lack of structure of the code and the pervasive presence of the operand stack also provide extra challenges for the analysis of bytecode. This workshop will focus on the latest developments in the semantics, verification, analysis, and transformation of bytecode. Both new theoretical results and tool demonstrations are welcome. Invited Speaker =============== TBA Submission ========== There are two paper categories, Regular and Tool demo papers. Paper should be written using the ENTCS style and submitted through the easy chair page "http://www.easychair.org/conferences/?conf=bytecode08". Please indicate in the submission page the category of your submission. Submissions will be evaluated by the Program Committee for inclusion in the ENTCS proceedings. Regular research papers should be at most 15 pages (including bibliography and excluding well-marked appendices not intended for publication). They must contain original contributions, be written in English and be unpublished and not submitted simultaneously for publication elsewhere. Tool demo papers must describe a completed, robust and well-documented tool -- highlighting the overall functionality of the tool, the interfaces of the tool, interesting examples and applications of the tool, an assessment of the tool's strengths and weaknesses, and a summary of documentation/support available with the tool. The body of the paper must be no longer than 6 pages in length (including bibliography), and it should give an overview of the tool, the methodology associated with its use, a summary of how the tool has been applied and to what effect, and it should indicate what supporting artifacts (user manual, example repository, downloads, etc) are available. This material will be included in the ENTCS proceedings if the paper is accepted. In addition, the paper should include an appendix (limited to six pages) that gives an outline of the proposed demo presentation (this material will NOT appear in the ENTCS proceedings). Program Committee ================= Wolfgang Ahrendt Chalmers University of Technology, SWE Elvira Albert (co-chair) Complutense University of Madrid, ESP June Andronick Security Lab - Gemalto, FRA David Aspinall University of Edinburgh, UK Cristina Cifuentes Sun Microsystems, AUS Samir Genaim (co-chair) Technical University of Madrid, ESP Sara Kalvala The University of Warwick, UK Gerwin Klein The University of New South Wales, AUS Francesco Logozzo Microsoft Research, USA David Pichardie INRIA Rennes (IRISA), FRA Tamara Rezk INRIA-Microsoft, FRA Fausto Spoto University of Verona, ITA Eran Yahav IBM T.J. Watson Research Center, 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/ -----------------------------------------------------------------------------

1 0

ICLP'08 CALL FOR PARTICIPATION
by ICLP 08 24 Sep '08

24 Sep '08

CALL FOR PARTICIPATION ICLP'08 24th International Conference on Logic Programming Udine, Italy, December 9th-13th, 2008 http://iclp08.dimi.uniud.it We are pleased to announce the 24th International Conference on Logic Programming, to be held in Udine, Italy, in December 2008. The ICLP'08 program includes 37 regular presentations, 26 short presentations, 4 tutorials, 5 workshops (ASPOCP, WG17, ALPSWS, WLPE and CICLOPS) and the traditional Prolog programming contest. The tutorials include presentations given by: - Carla Piazza e Alberto Policriti (Systems Biology: Models and Logics) - Angelo Montanari (Temporal Logics) - Tom Schrjivers (Constraint Handling Rules) - Peter O'Hearn (Separation Logic) Moreover the program features the invited talk by Vitor Santos Costa (The Life of a Logic Programming System) and a second invited talk TBA. The conference celebrates the 20th anniversary of the stable-model semantics with a special session at ICLP 2008 dedicated to answer-set programming. The session will feature invited talks by Michael Gelfond, Vladimir Lifschitz, Nicola Leone and David Pearce, as well as by other major contributors to the field, presenting personal perspectives on the stable-model semantics, its impact and its future. Online registration for ICLP is now open at: http://iclp08.dimi.uniud.it/ICLPRegistrationForm/ICLP2008registration.html Deadline for early registration is October 15, 2008. ---------------------------------------------------- For further information: iclp08(a)cs.nmsu.edu http://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/ -----------------------------------------------------------------------------

1 0

PEPM'09 -- Final Call for Papers
by G. Puebla and G. Vidal 24 Sep '08

24 Sep '08

F I N A L C A L L F O R P A P E R S === P E P M 2009 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.clip.dia.fi.upm.es/Conferences/PEPM09 January 19-20, 2009 Savannah, Georgia, USA (Affiliated with POPL 2009) IMPORTANT DATES Abstract due: October 12, 2008 Submission: October 17, 2008 Author Notification: November 10, 2008 Camera-Ready Paper: November 17, 2008 SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. PEPM is classified as category A in the CORE ranking of ICT conferences. The 2009 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue last years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'09 include, but are not limited to: * Program and model manipulation techniques such as transformations driven by rules, patterns, or analyses, partial evaluation, specialization, program inversion, program composition, slicing, symbolic execution, refactoring, aspect weaving, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as abstract interpretation, static analysis, binding-time analysis, dynamic analysis, constraint solving, and type systems. * Analysis and transformation for programs/models with advanced features such as objects, generics, ownership types, aspects, reflection, XML type systems, component frameworks, and middleware. * Techniques that treat programs/models as data objects including meta-programming, generative programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including experimental studies, engineering needed for scalability, and benchmarking. Examples of application domains include legacy program understanding and transformation, domain-specific language implementations, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. We especially encourage papers that break new ground including descriptions of how program/model manipulation tools can be integrated into realistic software development processes, descriptions of robust tools capable of effectively handling realistic applications, and new areas of application such as rapidly evolving systems, distributed and webbased programming including middleware manipulation, model-driven development, and on-the-fly program adaptation driven by run-time or statistical analysis. SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Two submission categories will be considered. Regular Research papers must not exceed 10 pages in ACM Proceedings style. Tool Demonstration papers must not exceed 4 pages in ACM Proceedings style and they should include an appendix of up to 6 additional pages giving an outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers is available on the PEPM'09 Web-site. Papers should be submitted electronically via the workshop web site. The workshop proceedings will be published in the ACM Digital Library and hardcopies will be distributed at the workshop. A journal special issue dedicated to PEPM'09 including selected papers is under consideration. PROGRAM CO-CHAIRS German Puebla, Technical University of Madrid, Spain German Vidal, Technical University of Valencia, Spain PEPM 2009 PROGRAM COMMITTEE David Binkley, Loyola College, USA Radhia Cousot, CNRS, France Silvia Crafa, University of Padova, Italy Stephen A. Edwards, Columbia University, USA Lidia Fuentes, University of Malaga, Spain John P. Gallagher, Roskilde University, Denmark Thomas Jensen,IRISA, France Yukiyoshi Kameyama, University of Tsukuba, Japan Siau Cheng Khoo, National University of Singapore Julia Lawall, University of Copenhagen (DIKU), Denmark Shin-Cheng Mu, Academia Sinica, Taiwan Naoki Nishida, Nagoya University, Japan Maurizio Proietti, CNR, Italy Armin Rigo, Switzerland Simon Thompson, Kent University, UK Tarmo Uustalu, Tallinn University of Technology, Estonia Wim Vanhoof, Namur University, Belgium Joost Visser, Software Improvement Group, The Netherlands Janis Voigtlander, TU Dresden, Germany ============================================================================== 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/ -----------------------------------------------------------------------------

1 0

Problem with clpq package.
by Victor Pablos Ceruelo 13 Jun '08

13 Jun '08

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/ -----------------------------------------------------------------------------

1 0

2008 ICLP Doctoral Consortium
by ICLP 08 11 Jun '08

11 Jun '08

********************************************************************** 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/ -----------------------------------------------------------------------------

1 0

Re: [forwarded from Hannes Strass]
by genaim＠gmail.com 10 Jun '08

10 Jun '08

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/ -----------------------------------------------------------------------------

1 0

Re: [forwarded from Hannes Strass]
by Samir Genaim 10 Jun '08

10 Jun '08

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/ -----------------------------------------------------------------------------

1 0

mime-version:content-type:content-transfer-encoding
by Hannes Strass 10 Jun '08

10 Jun '08

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/ -----------------------------------------------------------------------------

1 0

← Newer
1
...
31
32
33
34
35
36
37
...
95
Older →

Jump to page:

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

Ciao-users