Hi,
I'm new to Prolog, I wonder if there is a 'not/1' or something similar
to use in Ciao, or do I have to write it myself?
Alex
==============================================================================
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, is there anyway to do that? I've tried hard to find this out but
it seems that it can't be done. Is that true?
==============================================================================
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/
-----------------------------------------------------------------------------
Tanks Bart. So I can create new predicates . I don´t touch prolog since the
times of my Sinclair Spectrum. By the way, The Ciao-emacs integration is
wonderful.
I´m involved in a meta-programming project in which I need also to modify
already asserted predicates . Can I get the definition of a clause and
manage his body either as a list or as any other serial object that Ciao may
have or, else, I must keep a copy of the asserted clause definitions in
variables?
On 8/23/05, Bart Demoen <Bart.Demoen(a)cs.kuleuven.ac.be> wrote:
>
>
>
> > can I assert and retract not only facts, but also dynamic clauses
> >
> > with variables such are:
> >
> > isSoon(Father, Son):-isFather(Son Father)
>
> Yes you can. Try:
>
> ?- assert((iknow(X) :- ireadthemanualabout(X))).
>
> yes
> ?- iknow(assert).
>
> :-)
>
> Bart Demoen
>
--
http://nocorrecto.blogspot.com
Hello, I´m new to Ciao.
can I assert and retract not only facts, but also dynamic clauses
with variables such are:
isSoon(Father, Son):-isFather(Son Father)
Hi,
I wonder where I can find some sample programs in Ciao Prolog (besides
the ones in the 'example' folder), and detailed tutorials(besides the
one on the homepage).
Alex
==============================================================================
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/
-----------------------------------------------------------------------------
Thanks Daniel,
> Unfortunately the "Teams" functionality as is described in that
> paper was implemented in a previous version of Ciao and that
> particular implementation does not currently run any more. It could
> be redone but we are actually moving instead to a newer model (see
> below). In the Ciao Subversion repository there is however a
> simple emulation of more or less the same functionality (the
> 'contrib/teams' package) that Amadeo Casas recently worked on. It
> is not very well tested yet, but you may want to give it a try (and
> report any problems).
Is it possible to gain read access to the subversion repository? I
couldn't find the details on the website anywhere. If so, I will
definitely take this teams implementation for a test drive and report
back.
> By the way, we are actually working on combining the teams package
> with the concurrent objects model and hope to include this in the
> distribution in not too long.
Sounds very promising! If you need an extra beta-tester for this
functionality at any stage, I would be happy to try it out on some of
the applications I have in mind.
Cheers,
Ryan
--
Ryan Kelly
http://www.rfk.id.au | This message is digitally signed. Please visit
ryan(a)rfk.id.au | http://www.rfk.id.au/ramblings/gpg/ for details
[ Please apologize for multiple postings ]
I would like to invite you and your students to participate in the
Special Semester on Gröbner Bases and Related Methods 2006,
February July 2006
Linz and Hagenberg, Austria
The special semester on Gröbner bases aims at bringing together
researchers from all over the world for joint research on Gröbner bases
and related theories and methods. Also, through the special semester,
knowledge on these theories should be made available and disseminated in
a new way that uses both recent advances in formalized mathematics as
well as web technol-ogy. Part of the effort during the special semester
will also go into special lectures, tutorials, and training and, after
the special semester, events for the dissemination of the research
re-sults will be organized. Both established researchers as well as
junior researchers, postdocs, and PhD students are welcome to
participate in the activities of the special semester.
For details and application, see: http://www.ricam.oeaw.ac.at/srs/groeb/
A low resolution version of our poster is attached. You can download the
high resolution version from our webpage.
Yours sincerely,
Bruno Buchberger
(Chair)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Alexander Zapletal, Dipl.-Ing.
Scientific Assistant of Professor Buchberger
Johann Radon Institute for Computational and Applied Mathematics (RICAM)
Austrian Academy of Sciences
Altenbergerstraße 69
A-4040 Linz, Austria
Phone office: ++43 732 2468 9983
E-mail: alexander.zapletal(a)oeaw.ac.at
Hi,
I am interested in trying out the "Teams" functionality described in
the paper "Implementing Distributed Concurrent Constraint Execution in
the CIAO System", whereby distributed processes cooperate in the
execution of a goal:
http://clip.dia.fi.upm.es/papers/ciao-dis-impl-prode_bitmap.pdf
I've found the concurrency primitives such as &> and <& in the
library module "hlc", but I cannot find how to access predicates such as
add_worker(Host,Id) which control the available workers.
Has this functionality changed form since the above paper was
produced, or am I simply not looking in the right place?
As some background, I am a Masters student at the University of
Melbourne, Australia, working on programming languages for multi-agent
systems.
Thanks for any help you can offer,
Ryan
==============================================================================
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/
-----------------------------------------------------------------------------
Hi,
I've had about a half-hour go at getting the latest Ciao release to
compile on my Gentoo Linux system, with is running on an Athlon64
procressor (so the architecture is x86_64). According to ciao_get_arch
this platform is not known to the installation procedure.
I had some limited success getting the compile running, but there seem
to be a few issues with the platform, such as the fact that sizeof(long)
is not 4 which violates some assertions in the source code.
I'm happy to work towards getting things compiling smoothly on this
platform, but before I go hacking around too much I was wondering if
anyone has already had success or any experience getting things working
on such a platform?
Thanks,
Ryan
--
Ryan Kelly
http://www.rfk.id.au | This message is digitally signed. Please visit
ryan(a)rfk.id.au | http://www.rfk.id.au/ramblings/gpg/ for details