Ciao-users March 2002

ciao-users@cliplab.org

8 participants
10 discussions

make_sql_persistent
by Alan Sneath 26 Mar '02

26 Mar '02

I'm having a few problems getting the make_sql_persistent (part of the persdb_mysql library) predicate to work as intended. I've had a look at the people.pl example file, and my code contains the following. At the top after loading the required libraries: sql_persistent_location(database, db(Database, User, Password, HP)) :- database_name(Database), mysql_user(User), mysql_password(Password), mysql_host_and_port(HP). ...which I assume is correct. However, during my program I have: make_sql_persistent(TypeList, NameList, database), where TypeList and NameList have been dynamically generated earlier (this predicate is called recursively on all tables in the database). All works fine until I try to extract information from the database. No matter which table I try to access, it always comes up with an existence_error when I run the program. I've used write statements to check the contents of TypeList and NameList and both are generated properly, and if I remove the statements to query the database, the program completes without error. Since I'm using the exact same method of retrieving information as in the people.pl example (which works without any errors), I can only assume I've done something wrong with the make_sql_persistent predicate... Anyone got any ideas?? Thanks in advance for any help.. -- Alan Sneath... "Hard work pays off in the future. Laziness pays off now"

1 0

Problem in obtaining alternative solutions
by Jane Loans 26 Mar '02

26 Mar '02

On the following code: ---------File "test.pl"------------- p(a). p(b). p(c). p(d,e). p(f,g). ------------------------------------ ---------Loading "test.pl", from Emacs, into Ciao----------------- ---------toplevel shell, and testing "p" predicate.--------------- ?- ensure_loaded('c:/test.pl'). {Reading /cygdrive/c/test.pl WARNING: (lns 5-6) predicate p/2 is already defined with arity 1} yes ?- p(X). X = a ? yes ?- ------------------------------------------------------------------ Two questions: * Are there any way of deactivating these warnings so obvious? * Why the listerning not asks me if I want alternative solutions? It is as if upon pressing "intro" after testing "p (X)." they are pressed two times the key "intro". It is problem of Emacs (it more sure), or of the listerning (not I believe it)? How I can solve it, because if not, it is impossible to obtain ever alternative solutions to a query? NOTE: I have installed in my computer: * GNU Emacs 21.1.1 (i386-msvc-windows98.2222) of 2001-10-22 * Ciao Prolog for Windows, version 1.7p162 __________________________________________________ Do You Yahoo!? Yahoo! Movies - coverage of the 74th Academy Awards® http://movies.yahoo.com/

2 1

solitaire.pl and AGs
by David 26 Mar '02

26 Mar '02

Hi I have find an implementaiton in prolog of simple Genetic Algorithms at this url http://www.ida.his.se/ida/~bjorne/GA/Simuleringar/ProGA/ I want to use it to improve my program solitaire.pl (see below) that can only solve listeboule(39,X,Y,Z). but not listeboule(44,X,Y,Z). or listeboulebytheend(6,X,Y,Z),listeboule(39,X,Y,Z1). Can i have some advice to use PROGA with CIAO-Prolog the solitaire.pl mouvement([closeto(boule(2,1),boule(2,2),boule(2,3)), closeto(boule(2,1),boule(4,7),boule(4,4)), closeto(boule(2,1),boule(1,3),boule(1,2)), closeto(boule(2,1),boule(2,4),boule(2,7)), closeto(boule(2,2),boule(2,3),boule(3,1)), closeto(boule(2,2),boule(4,8),boule(4,5)), closeto(boule(2,2),boule(2,1),boule(1,3)), closeto(boule(2,2),boule(2,5),boule(2,8)), closeto(boule(2,3),boule(2,6),boule(2,9)), closeto(boule(2,3),boule(4,9),boule(4,6)), closeto(boule(2,3),boule(2,2),boule(2,1)), closeto(boule(2,3),boule(3,1),boule(3,2)), closeto(boule(2,4),boule(2,5),boule(2,6)), closeto(boule(2,4),boule(2,1),boule(4,7)), closeto(boule(2,4),boule(1,6),boule(1,5)), closeto(boule(2,4),boule(2,7),boule(5,1)), closeto(boule(2,5),boule(2,6),boule(3,4)), closeto(boule(2,5),boule(2,2),boule(4,8)), closeto(boule(2,5),boule(2,4),boule(1,6)), closeto(boule(2,5),boule(2,8),boule(5,2)), closeto(boule(2,6),boule(3,4),boule(3,5)), closeto(boule(2,6),boule(2,3),boule(4,9)), closeto(boule(2,6),boule(2,5),boule(2,4)), closeto(boule(2,6),boule(2,9),boule(5,3)), closeto(boule(2,7),boule(2,8),boule(2,9)), closeto(boule(2,7),boule(2,4),boule(2,1)), closeto(boule(2,7),boule(1,9),boule(1,8)), closeto(boule(2,7),boule(5,1),boule(5,4)), closeto(boule(2,8),boule(2,9),boule(3,7)), closeto(boule(2,8),boule(2,5),boule(2,2)), closeto(boule(2,8),boule(2,7),boule(1,9)), closeto(boule(2,8),boule(5,2),boule(5,5)), closeto(boule(2,9),boule(3,7),boule(3,8)), closeto(boule(2,9),boule(2,6),boule(2,3)), closeto(boule(2,9),boule(2,8),boule(2,7)), closeto(boule(2,9),boule(5,3),boule(5,6)), closeto(boule(1,1),boule(1,2),boule(1,3)), closeto(boule(1,1),boule(1,4),boule(1,7)), closeto(boule(1,2),boule(1,3),boule(2,1)), closeto(boule(1,2),boule(1,5),boule(1,8)), closeto(boule(1,3),boule(2,1),boule(2,2)), closeto(boule(1,3),boule(1,6),boule(1,9)), closeto(boule(1,3),boule(1,2),boule(1,1)), closeto(boule(1,4),boule(1,5),boule(1,6)), closeto(boule(1,5),boule(1,6),boule(2,4)), closeto(boule(1,6),boule(2,4),boule(2,5)), closeto(boule(1,6),boule(1,5),boule(1,4)), closeto(boule(1,7),boule(1,8),boule(1,9)), closeto(boule(1,7),boule(1,4),boule(1,1)), closeto(boule(1,8),boule(1,9),boule(2,7)), closeto(boule(1,8),boule(1,5),boule(1,2)), closeto(boule(1,9),boule(2,7),boule(2,8)), closeto(boule(1,9),boule(1,6),boule(1,3)), closeto(boule(1,9),boule(1,8),boule(1,7)), closeto(boule(3,1),boule(3,2),boule(3,3)), closeto(boule(3,1),boule(2,3),boule(2,2)), closeto(boule(3,1),boule(3,4),boule(3,7)), closeto(boule(3,2),boule(3,1),boule(2,3)), closeto(boule(3,2),boule(3,5),boule(3,8)), closeto(boule(3,3),boule(3,2),boule(3,1)), closeto(boule(3,3),boule(3,6),boule(3,9)), closeto(boule(3,4),boule(2,6),boule(2,5)), closeto(boule(3,4),boule(3,5),boule(3,6)), closeto(boule(3,5),boule(3,4),boule(2,6)), closeto(boule(3,6),boule(3,5),boule(3,4)), closeto(boule(3,7),boule(3,8),boule(3,9)), closeto(boule(3,7),boule(3,4),boule(3,1)), closeto(boule(3,7),boule(2,9),boule(2,8)), closeto(boule(3,8),boule(3,5),boule(3,2)), closeto(boule(3,8),boule(3,7),boule(2,9)), closeto(boule(3,9),boule(3,6),boule(3,3)), closeto(boule(3,9),boule(3,8),boule(3,7)), closeto(boule(4,1),boule(4,2),boule(4,3)), closeto(boule(4,1),boule(4,4),boule(4,7)), closeto(boule(4,2),boule(4,5),boule(4,8)), closeto(boule(4,3),boule(4,2),boule(4,1)), closeto(boule(4,3),boule(4,6),boule(4,9)), closeto(boule(4,4),boule(4,5),boule(4,6)), closeto(boule(4,4),boule(4,7),boule(2,1)), closeto(boule(4,5),boule(4,8),boule(2,2)), closeto(boule(4,6),boule(4,5),boule(4,4)), closeto(boule(4,6),boule(4,9),boule(2,3)), closeto(boule(4,7),boule(4,8),boule(4,9)), closeto(boule(4,7),boule(4,4),boule(4,1)), closeto(boule(4,7),boule(2,1),boule(2,4)), closeto(boule(4,8),boule(4,5),boule(4,2)), closeto(boule(4,8),boule(2,2),boule(2,5)), closeto(boule(4,9),boule(4,6),boule(4,3)), closeto(boule(4,9),boule(4,8),boule(4,7)), closeto(boule(4,9),boule(2,3),boule(2,6)), closeto(boule(5,1),boule(5,2),boule(5,3)), closeto(boule(5,1),boule(2,7),boule(2,4)), closeto(boule(5,1),boule(5,4),boule(5,7)), closeto(boule(5,2),boule(2,8),boule(2,5)), closeto(boule(5,2),boule(5,5),boule(5,8)), closeto(boule(5,3),boule(2,9),boule(2,6)), closeto(boule(5,3),boule(5,2),boule(5,1)), closeto(boule(5,3),boule(5,6),boule(5,9)), closeto(boule(5,4),boule(5,5),boule(5,6)), closeto(boule(5,4),boule(5,1),boule(2,7)), closeto(boule(5,5),boule(5,2),boule(2,8)), closeto(boule(5,6),boule(5,3),boule(2,9)), closeto(boule(5,6),boule(5,5),boule(5,4)), closeto(boule(5,7),boule(5,8),boule(5,9)), closeto(boule(5,7),boule(5,4),boule(5,1)), closeto(boule(5,8),boule(5,5),boule(5,2)), closeto(boule(5,9),boule(5,6),boule(5,3)), closeto(boule(5,9),boule(5,8),boule(5,7))]). delete(_,[],[]). delete(X,[X|Q],R):-delete(X,Q,R). delete(X,[T|Q],[T|RQ]):-X\=T,delete(X,Q,RQ). inserer([],boule(X,Y),[boule(X,Y)]). inserer([boule(X1,Y1)|B],boule(X,Y),[boule(X,Y),boule(X1,Y1)|B]):- X<X1. inserer([boule(X1,Y1)|B],boule(X,Y),[boule(X,Y),boule(X1,Y1)|B]):- X=X1, Y<Y1. inserer([boule(X1,Y1)|B],boule(X,Y),[boule(X1,Y1)|C]):- X>X1, inserer(B,boule(X,Y),C). inserer([boule(X1,Y1)|B],boule(X,Y),[boule(X1,Y1)|C]):- X=X1, Y>Y1, inserer(B,boule(X,Y),C). trier([],C,C). trier([E|B],C,D):- inserer(C,E,A), trier(B,A,D). trierfinal(A,B):-trier(A,[],B). listeboule(1, [boule(1,1), boule(1,2), boule(1,3), boule(1,4), boule(1,5), boule(1,6), boule(1,7), boule(1,8), boule(1,9), boule(2,1), boule(2,2), boule(2,3), boule(2,4), boule(2,5), boule(2,6), boule(2,7), boule(2,8), boule(2,9), boule(3,1), boule(3,2), boule(3,3), boule(3,4), boule(3,5), boule(3,6), boule(3,7), boule(3,8), boule(3,9), boule(4,1), boule(4,2), boule(4,3), boule(4,4), boule(4,5), boule(4,6), boule(4,7), boule(4,8), boule(4,9), boule(5,1), boule(5,2), boule(5,3), boule(5,4), boule(5,5), boule(5,6), boule(5,7), boule(5,8)], [boule(5,9)], []). listeboule(N,Listeboule,Listeboulevide,Allmouvement):- N > 1, N1 is N-1, listeboule(N1,Listeboule1,Listeboulevide1,Allmouvement1), mouvement(Move), member(closeto(Boule1,Boule2,Boulevide),Move), member(Boulevide,Listeboulevide1), member(Boule1,Listeboule1), member(Boule2,Listeboule1), delete(Boule1,Listeboule1,Listeboule2), delete(Boule2,Listeboule2,Listeboule3), Listeboule4=[Boulevide|Listeboule3], trierfinal(Listeboule4,Listeboule), delete(Boulevide,Listeboulevide1,Listeboulevide2), Listeboulevide3=[Boule1,Boule2|Listeboulevide2], trierfinal(Listeboulevide3,Listeboulevide), Allmouvement=[closeto(Boule1,Boule2,Boulevide)|Allmouvement1]. listeboulebytheend(1,[boule(2,9)], [boule(1,1), boule(1,2), boule(1,3), boule(1,4), boule(1,5), boule(1,6), boule(1,7), boule(1,8), boule(1,9), boule(2,1), boule(2,2), boule(2,3), boule(2,4), boule(2,5), boule(2,6), boule(2,7), boule(2,8), boule(3,1), boule(3,2), boule(3,3), boule(3,4), boule(3,5), boule(3,6), boule(3,7), boule(3,8), boule(3,9), boule(4,1), boule(4,2), boule(4,3), boule(4,4), boule(4,5), boule(4,6), boule(4,7), boule(4,8), boule(4,9), boule(5,1), boule(5,2), boule(5,3), boule(5,4), boule(5,5), boule(5,6), boule(5,7), boule(5,8), boule(5,9)], []). listeboulebytheend(Nf,Listeboulef,Listeboulevidef,Allmouvementf):- Nf > 1, N2 is Nf-1, listeboulebytheend(N2,Listeboule1f,Listeboulevide1f,Allmouvement1f), mouvement(Movef), member(closeto(Boule1f,Boule2f,Boulevidef),Movef), member(Boulevidef,Listeboule1f), member(Boule1f,Listeboulevide1f), member(Boule2f,Listeboulevide1f), delete(Boule2f,Listeboulevide1f,Listeboulevide2f), delete(Boule1f,Listeboulevide2f,Listeboulevide3f), Listeboulevide4f=[Boulevidef|Listeboulevide3f], trierfinal(Listeboulevide4f,Listeboulevidef), delete(Boulevidef,Listeboule1f,Listeboule2f), Listeboule3f=[Boule1f,Boule2f|Listeboule2f], trierfinal(Listeboule3f,Listeboulef), Allmouvementf=[closeto(Boule1f,Boule2f,Boulevidef)|Allmouvement1f].

1 0

Re: Problem in obtaining alternative solutions
by Bregor 24 Mar '02

24 Mar '02

> * Why the listerning not asks me if I want alternative solutions? > It is as if upon pressing "intro" after testing "p (X)." they > are pressed two times the key "intro". > It is problem of Emacs (it more sure), or of the listerning (not > I believe it)? > How I can solve it, because if not, it is impossible to obtain > ever alternative solutions to a query? If i understood your second question i think you must put a ';' in order to obtain more solutions (or alternative solutions). For example: ?- p(X). X = a ? ; X = b ? <-- here you can put more ';' if you want more solutions (if there aren't more solutions you must see something like no and ?- , the prompt) yes ?- Bye

1 0

Re: MySQL ...
by Manuel Carro 08 Mar '02

08 Mar '02

>> Cia prolog version: 1.7p162 >> OS: Debian GNU/Linux (not sure about the version since I didn't install >> it, /etc/debian_version reports 2.2) What does 'locate libmysql' in a shell return? If it does return something like /usr/lib/mysql/libmysqlclient.so.10.0.0 /usr/lib/mysql/libmysqlclient.so.10 /usr/lib/mysql/libmysqlclient.so.9.0.0 /usr/lib/mysql/libmysqlclient.a /usr/lib/mysql/libmysqlclient.so /usr/lib/mysql/libmysqlclient.so.9 (the critical part is that the libraries are under /usr/lib/mysql , and not directly under /usr/lib ), then go to the file mysql_client.pl and change the extra_linker_opts declaration to be :- extra_linker_opts('LINUXi86', ['-L/usr/lib/mysql -lz']). (note the '-L'). Recompile and try again, and please let us know how it went. MCL ___________________________________________________________ Never hit a man with glasses. Hit him with a baseball bat.

1 0

Re: MySQL ...
by Manuel Carro 07 Mar '02

07 Mar '02

>> I appear to have compiled the persdb_mysql library and all but when I >> try the people.pl example I get the following error: >> >> {ERROR: dynlink/2: could not find initialization function} Which Ciao Prolog version and operating system (and version) are you using? The error is strange, because it seems that the dynamic library is being loaded, but a function is not found. However, the .c file is generated automatically, so the initialization function *should* be there... MCL ___________________________________________________________ Never hit a man with glasses. Hit him with a baseball bat.

1 0

MySQL ...
by Kris Gybels 07 Mar '02

07 Mar '02

I appear to have compiled the persdb_mysql library and all but when I try the people.pl example I get the following error: {ERROR: dynlink/2: could not find initialization function} Any ideas? :)

1 0

MySQL
by Kris Gybels 07 Mar '02

07 Mar '02

*sigh* I'm having a lot of trouble getting the persdb_mysql library to work. Anyone can help?

1 0

MySQL Database Interface (repost)
by Alan Sneath 06 Mar '02

06 Mar '02

(Apologies if this message gets sent twice - slight problems with the mail server last time) Can anyone help with using the MySQL database interface? I've written and compiled my own program (and also tried running one of the examples) and both return the following error: ERROR: library library(persdb_mysql/delete_compiler/pl2sqldelete) not found, exiting... This same error is returned on all three linux systems I've tried the programs on. I've found the pl2sqldelete.pl file in <ciao_installation_directory>/library/persdb_mysql/delete_compiler/ which apparently hasn't been compiled in, but the NOCOMPILE file says not to change this. Does anyone have any idea what I've missed/should change in order to get this to work? Thanks in advance... -- Alan Sneath

4 3

Icsm 2002 Call for Papers: deadline is approaching
by icsm2002.info＠unisannio.it 06 Mar '02

06 Mar '02

Dear Colleague I would like to remind you that the ICSM full paper submission deadline is approaching. ICSM (IEEE International Conference on Software Maintenance), 2002, and associated workshops: SCAM, WSE, and WESS will be held next October 2002 in Montreal, Canada. Outstanding Keynotes such as Jon Pincus, Microsoft, Industrial and experience papers, research papers, tutorials, tool expositions, dissertation forum, workshops, panels, and other exciting activities have been planned. We hope that this "Call For Papers" will be useful for your work. Please forward the following to anybody who you think may be interested. Our apologies if you received multiple copy of this. If you would like to be removed from our list please send an email to icsm2002.info(a)unisannio.it with REMOVE in the subject. ICSM2002 Giuliano Antoniol, Program CoChair Ira D. Baxter, Program CoChair ============================================================================ IEEE International Conference on Software Maintenance 2002 Sponsored by IEEE ICSM-2002, Montreal, Canada, 3-6 October 2002 http://www.icsm2002.org icsm2002.info(a)unisannio.it Call for Papers Theme: Maintaining distributed heterogeneous systems ICSM is the major international conference in the field of software and systems maintenance, evolution, and management. This year's theme elaborates on last year's theme of "systems and software evolution in the era of the internet". Standalone legacy applications of yesterday and novel applications using today's technologies are rapidly becoming integrated as part of enterprise-wide and industry-wide systems. The need for rapid integration has led to many distributed heterogeneous systems that are very challenging to maintain and evolve. ICSM 2002 will address these new scenarios and the major challenges of maintenance and evolution. The focus of the conference will be on the new challenges that heterogeneous systems pose for software maintenance, and the new opportunities for researchers and practitioners. A main goal of ICSM is to promote interaction between researchers and practitioners. ICSM 2002 will bring together researchers, practitioners, developers and users of tools, technology transfer experts, and project managers. Jon Pincus (Microsoft) will describe how Microsoft handles software enhancements. Other outstanding Keynote speakers are being arranged. Past conferences have had Parnas, Rombach, McCabe, and Jacobson. ICSM-2002 will offer technical presentations and demonstrations from academia and industry. We are particularly interested in exchanging concepts, prototypes, research ideas, and other results that could contribute to the academic arena and also benefit business and the industrial community. ICSM 2002 will be participatory, with working collaborative sessions and presentations of industry projects. The Conference will be held in conjunction with: WESS -- Workshop on Empirical Studies of Software Maintenance. SCAM -- Source Code Analysis and Manipulation WSE -- Workshop on WEBsite Evolution Topics of interest include but are not restricted to the following aspects of maintenance and evolution: - Methods and theories - Maintenance and/or productivity metrics - Organizational frameworks - Preventive maintenance - Design for maintenance - Tools and environments - Life cycle and process control - Models/methods for error prediction - User interface evolution - Commercial off-the-shelf (COTS) - Third party maintenance - Freeware and open source applications - Program comprehension - Software and system visualisation - Knowledge based systems - Measurement of software - Formal methods - Legal aspects and standards - Software reusability - Internet and distributed systems - Empirical studies - Testing and regression testing - Remote, tele-work - Version and configuration management - Processes and strategies - Management and organisation - Co-operative applications - Source code analysis and manipulation - Processes and strategies - Impact of new software practices - Programming languages - Reengineering and reverse engineering - Multimedia systems RESEARCH PAPERS: Research papers should describe original and significant work in the research and practice of software maintenance and evolution. Case studies, empirical research, and experiments are particularly welcome. We also welcome papers that present leading edge and novel ideas in maintenance. Papers must not exceed 5000 words (10 pages IEEE style) in length, in English. To encourage strong submissions a prize will be awarded for the "Best Paper as Submitted". This Prize is offered by John Wiley & Sons, the publishers of the Journal of Software Maintenance and Evolution. The Program Committee will select the winner and a formal presentation of the Prize will be made in Montreal at ICSM 2002. FAST TRACK PAPERS: Fast Track papers should describe on-going research activities, or summarize the experience in software maintenance and evolution. Papers must not exceed 4 pages, IEEE style, in length, in English. Accepted fast-track papers will be included in a dedicated section of the conference proceedings. DISSERTATION FORUM: We welcome submissions of young researchers that have delivered their dissertation (Masters or Ph.D.) in the last three years. An award will be issued for the best submission. Four page summaries of accepted dissertations will be included in the conference proceedings and a special forum section will be organised at the conference. INDUSTRIAL APPLICATIONS: Proposals for presentations of Industrial Applications are welcome. These can be state-of-the-art descriptions, experience reports and survey reports from real projects, industrial practices and models, or tool demonstrations. A dedicated sub-committee of the program committee will review Industrial Application proposals and a 1-page summary of accepted proposals will be included in the conference proceedings. TUTORIALS: Tutorials should present software maintenance and evolution topics of interest to practitioners. Tutorials may be full day or half-day in length. SUBMISSION STYLE: PDF and/or Postscript electronic submission only. Papers longer than 15 pages or 6000 words will be returned to the authors. Acceptance notification will occur July 1, 2002. IMPORTANT DATES Research Papers deadline: 18 March 2002 mailto:icsm2002.full(a)unisannio.it Fast Track Papers deadline: 1 May 2002 mailto:icsm2002.short(a)unisannio.it Dissertation Forum deadline: 1 May 2002 mailto:icsm2002.thesis(a)unisannio.it Industrial Applications deadline: 1 May 2002 mailto:icsm2002.industry(a)unisannio.it Tutorials deadline: 18 March 2002 mailto:icsm2002.tutorial(a)unisannio.it

1 0

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 March 2002