http://blog.gmane.org/gmane.comp.ai.prolog.swi hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://comments.gmane.org/gmane.comp.ai.prolog.swi/16819 <pre>I have been unable to run prolog from the command line to (a) load a swi prolog file and (b) execute a predicate/goal. The predicate writes to a file, so I can see that it has executed. I’ve tried a variety of combinations (and orderings) of the command below: Ø swipl -t ‘printout’ –c trules.pl where printout is the goal to execute once trules.pl has been loaded. If someone can explain what I am doing wrong, I’d be most appreciative. Thank you in advance. don Batory. -------------- next part -------------- HTML attachment scrubbed and removed </pre> don batory 2012-05-25T13:59:06 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16816 <pre>Dear all, being new to this list I hope to use it as it is thought to be. I use an arithmetic_function like :- arithmetic_function(predicate/5). predicate(P1, P2, P3, P4, P5, P6) :- (P1 = ..., P6 is 0, ! ;P2 = ..., P6 is 1, ! ... ), !. The architecture is to use both definitions within a module that is compiled into an executable (so no screen). With using the swi-pl version 6 I get now the message "Wrong context: arithmetic_function/1 can only be used in a directive". What is my mistake? Thank you very much Matthias Leopold </pre> Leopold, Matthias 2012-05-25T11:44:56 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16809 <pre>Hi, Clearly, something is wrong with my package initiative. I know the version in 6.1.4 suffered from technical issues. I also happen to know from the download statistics that nearly all users happen to prefer the stable (e.g., 6.0.x) version. The reported issues should be solved in 6.1.5. Nevertheless, only a small `hello world' package and only 2 downloads indicate there is something wrong. On the other hand, I received enough mail that indicates that people want a package system and I see successes using repositories for other systems. Please, provide feedback on what you think is wrong. Also, think of the code you have lying around and want to share. Creating a pack is really easy and only requires a packaging tool (tar or zip), a place on the web to upload to (Dropbox can be used as indicated by the hello package) and an internet connection. Cheers --- Jan </pre> Jan Wielemaker 2012-05-24T19:23:20 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16808 <pre>Hi, After a far too long delay and several chats, I've made a decision on the new SWI-Prolog logo. You find the new logo on the website as well as in the application icons of 6.1.5. The winning logo is an owl by Steve Reeves (http://www.pixelmagic.co.nz/). The logo is simple and colourful, while an owl has various relevant associations. The logo is distributed under the creative commons SA (Share Alike) license, which implies you can make your own variations as long as you distribute them under the same license. Thanks to everybody who contributed! Enjoy --- Jan </pre> Jan Wielemaker 2012-05-24T19:10:56 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16807 <pre>Hi, I've uploaded SWI-Prolog 6.1.5. Highlights: * Fixed handling of interrupt (Control-C) on non-Windows platforms. (solved by Keri Harris). * Avoid compiling files in system mode when compiling from the debugger and the debugger is running in its own thread. * Fixed two debugger-related GC errors (causes crashes while debugging) * Reduced locking in findall/3 and sending messages between threads. (more will follow for findall/3). * Avoid leaking memory on the trail-stack when using setarg/3 (also attributed variables) in certain settings. * Fixed some arithmetic issues; added copysign/2. * Some issues with the package system: address of the server, create user directory and deal with older versions of libarchive. * Replaced website and program icons with the new logo. Enjoy --- Jan ================================= SWI-Prolog Changelog since V6.1.4 ================================= * PORT: Use _copysign() on Microsoft compilers. Per Mildner. * ADDED: function copysign/2 * ISO: Fixed sign/1 function with help from Mats, Joachim and Richard. * FIXED: Avoid destruction of message queues if the queue is not initialized (can happen when creating a thread with illegal options). Keri Harris. * FIXED: Proper type errors if option values have the wrong type. * PORT: Define O_SHARED_KERNEL on Windows; initialize the TLS index and mutexes in DllMain() This avoids double initialization because initPrologThreads() can be called multiple times and without initialized mutexes there is litle we can do. * FIXED: abs(-0.0). Anjo Anjewierden. Uses signbit() if provided and hard-coded IEEE754 bit checking if might be -0.0. * FIXED: 5 rdiv 3 is 5 rdiv 3. Abramo Bagnara. * FIXED: Do not bail out if code-walking finds a call to a non-callable term, but kindly report it. * FIXED: Trail memory leak when combining normal unificiation with destructive assignment. Keri Harris. * FIXED: Allow asynchronous scanning of segmented stacks. * FIXED: Make current_key(+) fail if the key exists but has no associated records. * FIXED: Possible crash in debugger for commit in -&gt;. This patch also fixes the -DO_DEBUG compilation mode. * CLEANUP: Use modern API and avoid (unlikely) race for get_thread() * FIXED: Race condition on thread_property/2. Keri Harris. * FIXED: Possible GC crash after a `retry' in the tracer. * ENHANCED: Avoid locking AGC for sending messages * ENHANCED: Mark atoms in findall bags from the stack marker. This avoids the need for locking L_AGC. * FIXED: Crash issues with ^C. Thanks to analysis on what went wrong by Keri Harris. * FIXED: Possible (but rather improbably) issue with atom-GC. This patch updates the way outdated comments on how atom-GC works, which must pave the road to remove the L_AGC lock in findall/3 and message queues. =============== Package archive =============== * FIXED: Item#651: Avoid failing installation if libarchive is missing. Ulrich Neumerkel. * PORT: Detect formats supported by the underlying library. Tom Schrijvers. ============ Package clib ============ * ADDED: Allow binding stdour and stderr to the same Prolog stream. ============== Package semweb ============== * ADDED: lib:format "turtle" to control the format of external resources. Various enhancements to loading external resources. ============ Package xpce ============ * FIXED: Windows: creating icons from images. This notably fixes the default image. * LOGO: Modified images in various places. * FIXED: Run the xpce thread with `generate_debug_info' set to true, which that files loaded from xpce stay debuggable. Jacco van Ossenbruggen. ============ Package zlib ============ * FIXED: Avoid failing installation if libzlib is missing. </pre> Jan Wielemaker 2012-05-24T19:03:24 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16804 <pre>Hello everybody! I'm a green hand of Prolog, and I have a problem must be solved now. Hope you can give me some helpful suggestions. In real world, one result may be reasoned by different premises. In Prolog, we may find several solutions to one query, each solution uses different predicates. For example, a following program: highPrice(X):- goodQuality(X). highPrice(X):- lookNice(X). highPrice(X):- monopolize(X,_). goodQuality(iPhone). lookNice(iPhone). monopolize(someOtherPhone,cellPhone). If we do a query: highPrice(iPhone), we will get true; true; false. But I want to figure out *by which predicate did I find the solution, *for example, the first output is true because goodQuality(iPhone). Do i have some ways to get the predicate I used and address this problem? If you have any idea please help me, thanks. :) -------------- next part -------------- HTML attachment scrubbed and removed </pre> 徐天宇 2012-05-24T15:30:34 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16802 <pre>I imagined these would be equivalent unless an exception occurs, but the former quits while the latter works.  What's going on? create_client(Host, Port) :-         setup_call_cleanup(tcp_socket(Socket),                                    tcp_connect(Socket, Host:Port),                                    tcp_close_socket(Socket)),         setup_call_cleanup(tcp_open_socket(Socket, In, Out),                            chat_to_server(In, Out),                            close_connection(In, Out)). create_client(Host, Port) :-         setup_call_catcher_cleanup(tcp_socket(Socket), %% different                                    tcp_connect(Socket, Host:Port),                                    exception(_), %% different                                    tcp_close_socket(Socket)),         setup_call_cleanup(tcp_open_socket(Socket, In, Out),                            chat_to_server(In, Out),                            close_connection(In, Out)).   Alan Baljeu -------------- next part -------------- HTML attachment scrubbed and removed </pre> Alan Baljeu 2012-05-22T15:03:41 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16799 <pre> Hi, I just installed a fresh copy of SWI-Prolog 6.0.2, and I cannot seem to get JPL to work. Calling Java from Prolog works fine, but the other way around gives the typical error .../libjpl.so: undefined symbol: PL_is_initialised I'm invoking java with the -Djava.library.path set correctly, the environment variable SWI_HOME_DIR is set correctly, and jpl.jar is of course in the classpath. I've tried compilation both with and without the "--enable-shared" option, but it does not make a difference. I've tried putting symlinks to libswipl.so* in /usr/lib/ (just to be sure it can be found), but that also does not help. It is a fresh Ubuntu 12.04 install, x86_64 architecture. Any help would be appreciated. Best regards, -Jon. Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm </pre> Jon Sneyers 2012-05-20T14:33:16 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16797 <pre>[Apologies for multiple copies...] ----------------------------------------------------------- WLPE 2012 - CALL FOR PAPERS Workshop on Logic-based Methods in Programming Environments (satellite workshop of ICLP 2012) September 8, 2012 Budapest, Hungary http://users.dsic.upv.es/workshops/wlpe2012/ ----------------------------------------------------------- The workshop aims at providing an informal meeting for researchers working on logic-based tools for development and analysis of programs. In addition to papers describing more conceptual work on environmental tools, we solicit papers describing the implementation of and experimentation with such tools. We hope to attain the same friendly atmosphere as in past workshops, which enabled fruitful exchanges leading to joint research and subsequent publications. Areas particularly relevant to the workshop include: * static and dynamic analysis * debugging and testing * program verification and validation * code generation from specifications * termination and non-termination analysis * reasoning on occurs-check freeness and determinacy * frameworks and resources for sharing in the logic programming community * profiling and performance analysis * type- and mode analysis * shape, point-to and escape analysis * module systems * optimization tools * program understanding * refactoring * logical meta-languages Note that this list is not exhaustive and, if you are interested in taking part in the workshop but unsure if your work falls within its scope, do contact the organisers who will be happy to advise. The 22nd Workshop on Logic-based methods in Programming Environments will take place in Budapest, Hungary, as a satellite workshop of ICLP 2012, the 28the International Conference on Logic Programming. This workshop will continue the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington, USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium and Port Jefferson, USA (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004), Sitges, Spain (2005), Seattle, Washington USA (2006), Porto, Portugal (2007), Udine, Italy (2008), Pasadena, USA (2009), Edinburgh, UK (2010), and Odense, Denmark (2011). This year WLPE will be coordinated with CICLOPS. In particular, there will be two special events organised: (a) SWI-25, a celebration and retrospective of the open source SWI-Prolog engine on the occasion of its 25th birthday, and (b) OpenPL, an event on (1) coordinating efforts towards furthering cross-engine compatibility, with a focus on libraries and add-on packages, and (2) the creation of a user-contributing repository of Prolog code. Submission guidelines --------------------- We encourage the submission of original research in the area as well as relevant results that have been submitted, rejected, or accepted elsewhere as long as they are relevant for the WLPE community. All papers must be written in English and should not exceed 15 pages. We welcome also shorter submissions, e.g., extended abstracts and short papers, of at least 3 pages. Papers should be submitted electronically via the submission page: https://www.easychair.org/conferences/?conf=wlpe2012 An informal proceedings will be distributed electronically at the workshop. After the workshop, the proceedings will be publicly available on-line in the Computing Research Repository (CoRR). Important dates --------------- Submission: June 20, 2012 Notification: July 16, 2012 Camera-ready: July 27, 2012 Workshop: September 8, 2012 Workshop organizers ------------------- Win Vanhoof Faculty of Computer Science University of Namur Namur, Belgium Email: wlpe2012&lt; at &gt;dsic.upv.es Alicia Villanueva Department of Computer Science (DSIC) Universitat Politècnica de València Valencia, Spain Email: wlpe2012&lt; at &gt;dsic.upv.es Program committee ----------------- Salvador Abreu Universidade de Évora, Portugal Petra Hofstedt University of Technology Berlin, Germany Jacob Howe City University London, UK Yoshitaka Kameya Tokyo Institute of Technology, Japan Roland Kaminski Universität Postdam, Germany Lunjin Lu Oakland University, USA Alexander Serebrenik Eindhoven University of Technology, The Netherlands Peter Schneider-Kamp University of Southern Denmark, Denmark Zoltan Somogyi University of Melbourne, Australia Win Vanhoof University of Namur, Belgium Alicia Villanueva Universitat Politècnica de València, Spain Damiano Zanardini Universidad Politécnica de Madrid, Spain </pre> Wim Vanhoof 2012-05-18T19:48:48 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16796 <pre>Hello Dear «Blue Book» lovers, I came to integrate the connection between Prolog &amp; SWI-Prolog. Everything's working well yet. For feeding my knowledge base I was pushing into a file, then later evaluating this file. so, with bw beeing a streamWriter: bw.append( myFact.toLowerCase() + "('" + myThing + "').\n" ) ; Even doing so on a tmpFS, I think I would gain performance creating them directly through the connector. So - and this is were my problem arise - I replaced my small lines to write into a file and evaluate it as my knowledge base, to push all my facts directly like this: jpl.Compound goal = new Compound( fact.toLowerCase(), new jpl.Term[] { new Atom(myThing) }); System.out.println( "rule crafted: " + goal.toString() ) ; jpl.Query q = new jpl.Query( goal ) ; But, that produces such kind of errors: [-] : PrologException: error(existence_error(procedure, /(father, 1)), context(:(system, /('$c_call_prolog', 0)), _1)) rule crafted: father('William') I'd like to understand what's my problem in using the second way to query &amp; fill my knowledge's base Regards, Alex </pre> Alexandre Hélias 2012-05-18T16:11:14 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16795 <pre> -------------------------------------------------------------- CICLOPS 2012 - Call for Papers 12th International Colloquium on Implementation of Constraint and LOgic Programming Systems ICLP 2012 Workshop 4th September 2012 Budapest, Hungary http://www.cs.unipr.it/ciclops12/ Submission deadline: June 20, 2012 -------------------------------------------------------------- This workshop aims at discussing and exchanging experience on the design, implementation, and optimisation of logic, constraint (logic) programming systems, and other systems based on logic as a means to express computations. Experience backed up by real implementations and their evaluation will be given preference, as well as descriptions of work in progress in that direction. Topics of interest include, but are not limited to: - Sequential implementation schemes (abstract machines, translation to other languages, etc.). - Implementation of concurrent and distributed logic and constraint programming systems. - Type inference and type checking systems for CLP languages. - Compile-time analysis and its application to code generation. - Balance between compile-time effort and run-time machinery, dynamic compilation. - Interaction between high-level optimisations/transformations/specialisation and low-level issues. - Memory management and garbage collection issues. - Indexing techniques and optimisations for large size programs. - Optimisations for program generated logic and constraint programs. - Implementation of logic engines in functional and object oriented languages. - Embedding of logic and constraint programming engines in multi-paradigm systems. - Techniques for alternative logic engines and inference mechanisms (ASP, SAT, QSAT, DL etc.). - Extensions to the inference engine such as stochastic, probabilistic and quantitative elements. - Theorem provers, proof assistants and logic based natural language processing systems. - Implementation of object and agent-oriented extensions. - Inductive logic programming. - Object and module systems. - Design and implementation of declarative I/O concepts. - Implementations and ports of CLP systems for mobile devices. - Documenting, debugging, testing, and profiling tools. - Implementations of learning algorithms in logical environments. - Interfaces and their applications to other languages and systems, eg. Java, web and databases. - Cross engine compatibility and user-enabled development. ------------------------------ Workshop Goals Our intent is to bring together, in an informal setting, people involved in research on sequential and parallel implementation technologies for logic and constraint programming languages and systems, in order to promote the exchange of ideas and feedback on recent developments. We hope that the workshop will provide a meeting point for people working on implementation technology for different aspects of logic and constraint-based languages and systems. We will foster and encourage discussions on the future of LP implementations with focus on extensions, standards, libraries, user-driven development and identification of key research and application areas. This year CICLOPS will be coordinated with WLPE. In particular, there will be two special events organised: (a) SWI-25, a celebration and retrospective of the open source SWI-Prolog engine on the occasion of its 25th birthday, and (b) OpenPL, an event on (1) coordinating efforts towards furthering cross-engine compatibility, with a focus on libraries and add-on packages, and (2) the creation of a user-contributing repository of Prolog code. ------------------------------ Submission Information Authors are invited to submit PDF files of papers written in English and not exceeding 15 pages using LNCS LaTeX format. Shorter submissions are also welcome, e.g. extended abstracts and short papers of at least 3 pages. Papers should be submitted electronically via : https://www.easychair.org/conferences/?conf=ciclops12 ------------------------------ Proceedings We plan for the informal workshop proceedings to be available on-line at the Computing Research Repository after the workshop. An electronic copy will also be distributed during the conference. ------------------------------ Important Dates Submission deadline: June 20, 2012 Notification of authors: July 16, 2012 Camera-ready copy due: July 27, 2012 Workshop date: Tuesday September 4, 2012 ------------------------------ Invited Speaker Tom Schrijvers (University of Ghent, Belgium) ------------------------------ History CICLOPS'11 continues a tradition of successful workshops on Implementations of Logic Programming Systems, previously held in Budapest (1993) and Ithaca (1994), the Compulog Net workshops on Parallelism and Implementation Technologies held in Madrid (1993 and 1994), Utrecht (1995) and Bonn (1996), the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages held in Port Jefferson (1997), Manchester (1998), Las Cruces (1999), and London (2000), and more recently the Colloquium on Implementation of Constraint and LOgic Programming Systems in Paphos (2001), Copenhagen (2002), Mumbai (2003), Saint Malo (2004), Sitges (2005), Seattle (2006), Porto (2007), Udine (2008), Pasadena (2009), Edinburgh (2010) - together with WLPE, Lexington (2011). ------------------------------ Program committee Mats Carlsson, SICS, Sweden Daniel Diaz, University of Paris, France Rémy Haemmerlé, Universidad Politécnica de Madrid, Spain Günter Kniesel, University of Bonn, Germany Paulo Moura, Porto and University of Beira Interior, Portugal Ricardo Rocha, University of Porto, Portugal Guido Tack, Monash University, Australia Paul Tarau, University of North Texas, USA Markus Triska, Vienna University of Technology, Austria Jan Wielemaker, Free University of Amsterdam, The Netherlands Neng-Fa Zhou, Brooklyn College, USA ------------------------------ Workshop Coordinators Nicos Angelopoulos, Netherlands Cancer Institute, The Netherlands Roberto Bagnara, University of Parma, Italy _______________________________________________ SWI-Prolog mailing list SWI-Prolog&lt; at &gt;lists.iai.uni-bonn.de https://lists.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog </pre> Nicos 2012-05-18T07:44:13 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16791 <pre>I saw an example on this thread this week.  It looks useful.  What and where is it?   Alan Baljeu -------------- next part -------------- HTML attachment scrubbed and removed </pre> Alan Baljeu 2012-05-17T14:22:18 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16785 <pre>Hi, There is a position available for a (SWI-)Prolog programmer. I have spent some time on the pilot phase, so I can explain the problem. There is a legacy expert system in chemical process design that has been designed since the late 80s. The system is huge (about 1,000,000 lines of Prolog). It was initially written for IF/Prolog 4 on Unix/X11. It has been ported to IF/Prolog 5 on Windows/MFC. During the pilot, we ported most of it to SWI-Prolog using a web-based interface. 25 years of development where we now emulate IF/Prolog 5 in SWI-Prolog, while the code emulates IF/Prolog 4 means that it is time for big-time refactoring. This requires a quite experienced Prolog programmer who can deal with Prolog meta-programming, which is used a lot in the emulation layers as well as the expert system itself. Meta-programming and program analysis skills are also needed to automate the upcomming refactoring process. In other words, this is a nice engineering challenge :-) Oh, about 80% of the code is in German and thus at least passive knowlege of German is really needed. Rest of the facts: About the project: - expert system for chemical process design - big legacy system, revival into web-interface. - Breda, the Netherlands What we are searching for: - swi-prolog knowledge and experience - english and german language - preferrably some basic chemical engineering knowledge - other tools: git, fortran, c, (x)html/javascript/css, (c)make, linux, etc. Please send your reaction to romme&lt; at &gt;process-design-center.com Cheers --- Jan </pre> Jan Wielemaker 2012-05-14T19:58:21 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16782 <pre>I'm slightly overwhelmed by the PL_blob_t stuff, and underwhelmed by the clarity of the documentation. I'm looking at a case I think would be the most common, and wish there was an example: Allocate a pointer (it's shared, never copied), store it in an atom, and have the pointer freed when all references go away. One point of confusion is the allocator predicate.  It seems the only way to create a blob is to register my own foreign_t which will then create the blob object.  But then why is the acquire(atom_t) function pointer needed? Anyway, it seems so basic, I wonder if there's a standing example that just defines the three methods to 1) malloc/new a pointer and put it in a blob atom 2) extract the pointer from an atom 3) delete the pointer and hooks this to SWI.   Alan Baljeu -------------- next part -------------- HTML attachment scrubbed and removed </pre> Alan Baljeu 2012-05-14T15:55:24 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16779 <pre>All: Sorry for the off-topic post, but can anyone suggest a good book or other resource on User Interface Design (that's in print here in the U.S.). Regards, Jeff R. -------------- next part -------------- HTML attachment scrubbed and removed </pre> Jeff Rosenwald 2012-05-13T15:23:00 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16772 <pre>Hi, The current SWI-Prolog package management was clearly a too big hurdle to take for many users. Before something can be accepted as standard package, it must - be maintained in a git repository - be portable to the main target systems: Linux, MacOS and Windows, 32 and 64-bits and at least in principle to other POSIX systems. - Be documented using the LaTeX and/or PlDoc standards - Have appropriate configure and make support. - Have a fair tradeof between value for users and size because it comes with all tarballs and binaries. After some peer pressure (especially by Tom Schrijvers; thanks), I finally came up with the first steps to make something really simple and without any central authority. It is far from complete, but in a nutshell - A pack is a directory with a small info file called pack.pl and a subdirectory 'prolog' that is added to the Prolog library. - Create an archive from this using tar or zip and put in on an HTTP server. - Download it yourself and it becomes automatically visible for all users. The central server at www.swi-prolog.org collects URLs of archive files, their SHA1 hashes, their info and download counts. It allows you to find packages and tracks (user specified) dependencies. The value is - Have one point to find packages - Install with one command from the Prolog commandline - Automatically checks and installs dependencies More info: - http://www.swi-prolog.org/howto/Pack.html On creating packages - http://www.swi-prolog.org/pldoc/doc_for?object=pack_install/1 Installs packages - http://www.swi-prolog.org/howto/PackTodo.txt for future plans. I've uploaded a small demo, which unfortunately requires some further installation :-( See readme.txt in the package. Please try it out and let this list know what you think is good/wrong/missing/... Cheers --- Jan P.s.WARNING: There is a typo in library(prolog_pack), which installs packages: edit the file and replace www.prolog.org with www.swi-prolog.org (line 81). </pre> Jan Wielemaker 2012-05-12T15:10:42 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16771 <pre>Hi, I'm happy to announce SWI-Prolog 6.1.4. The list of changes is long. Here are the highlights: * Randy Sharp has fixed zillions of typos in the reference manual. Thanks! * There is a basic package management system that allows users to share packages really easily (I hope). Will be announced in a seperate mail. * Many enhancements to code reachability checking for list_undefined (make), autoload and development tools. * Various enhancements to PceEmacs. Ctrl+/- to zoom in/out, colouring, etc. * Distinguish imports using use_module/1 from use_module/2. The first may be locally overruled. * Various stability issues. Enjoy --- Jan ================================= SWI-Prolog Changelog since V6.1.3 ================================= * ADDED: library(prolog_pack) for installation of Prolog package. * FIXED: Recent changes to autoload update didn't work with patterns like dir/*.pl. * FIXED: numbervars/3 to number inside '$VAR'(X). Tobias Rho. * ENHANCED: Tighter checking of consistency when creating supervisors. This reduces the risc of creating invalid supervisors if the supervisor is created while the predicate is being reloaded by another thread. * ENHANCED: Supervisors of reloaded predicates may be executing. We use PL_linger() to deal with this. Note that this implies that such objects are garbage collected when using Boehm-GC and leaked otherwise. * MAINTENANCE: Support -DALLOC_DEBUG again. Keri Harris * MODIFIED: Stop current_predicate/1 generating system modules. This used to be the case anyway, but the implementation used an outdated way to detect system modules. Makes current_predicate/1 and current_predicate/2 consistent while generating predicates. Guenter Kniesel. * ENHANCED: Avoid changing the working directory for updating the autoload index. * FIXED: Thread-safety of absolute_file_name/2 and friends. * FIXED: Avoid crash in canonisePath(""). * FIXED: Possible crash in reconsult if another thread uses clause/2. Keri Harris. * PORT: Avoid to (harmfully) #undef stat from uxnt.h. Should not be needed any longer and breaks MinGW port. * PORT: Use CryptGenRandom() on Windows regardless of the compiler (e.g., MinGW). * ADDED: Introduce // as meta-predicate indicator for DCG goals. * FIXED: Emulation of IF/Prolog current_visible/2 * ADDED: Make undefined-code walker analyse DCG bodies as argument to phrase/3. Mike Elston. * FIXED: Garbage collector not marking pushed `new' arguments for temporary code compiled on behalve of meta-calling control structures. This can lead to crashes. Fixed with help from Abramo and Roberto Bagnara. Note that this is typically not a problem because terms are passed as special variables and the variable access ensures they get marked. The counter example is meta-calls such as call((f(M), M:v(X))). The current compiler creates M:v(X) using normal B_FUNCTOR constructs and this pushed `new' argument must be marked by GC. * FIXED: forAtomsInClause() when using break instructions. Also added a vm_list() to print (simplified) VM instructions. * FIXED: Consistent usage of malloc/GC_malloc when using SECURE_GC * ENHANCED: Print the identifiers of threads that didn't die at halt * PORT: More stuff for the new requirements distribution * PORT: Use Git for distributing the Windows requirments * MODIFIED: Print all unhandled exceptions when called from C without telling Prolog that the context will handle exceptions. Before, error(_,_) exceptions were printed and other were handled as (silent) failure. * FIXED: Error positions in code-references resolved by called_by/2. Mike Elston. * ENHANCED: Issue#643: Avoid non-determinism in current_op/3. Ulrich Neumerkel. * FIXED: Issue#644: Syntax error in `dec10 mode' (default for reading programs) did not reset LD-&gt;exception.processing, causing incorrect usage of the spare stack. Ulrich Neumerkel. * ADDED: pack_attach/0 and pack_attach/1. After some discussions with Tom Schrijvers. This is the first step towards a package management system that will be developed shortly. * FIXED: Issue#646; failing stack expansion in subsumes_term(). Ulrich Neumerkel. * FIXED: \+ in DCG. Patch by Ulrich Neumerkel. * ENHANCED: Use atomic operations for PL_(un)register_atom(). * DOC: min_list/2. Peer Valhoegen. * FIXED: Avoid localised definitions (thread_local/1) to be collected by bwdgc * PORT: Updated Windows requirements to version 4 * PORT: swipl-ld.exe to add .exe to intermediate results * PORT: Use zlibwapi, also on 32-bit windows * PORT: Work around strange MSVC issue with __int64 * FIXED: Various issues in preserving the proper source location. Could cause crashes due to clause registered with non-existent source files. Reported by Uwe Lesta. * FIXED: prolog_current_choice/1 and prolog_choice_attribute(C, parent, P) no longer return `debug' choice-points. Such choice-points may be discarded unexpectedly and cause different behaviour in debug and nodebug mode. * FIXED: Non-determinism in get_until/4 * ENHANCED: Extend max number of meta-arguments from 8 to 16. * MODIFIED: :- reexport(File) now also reexports operators. Tom Schrijvers. * PORT: Bug#33: wrong configure patch in fb745832eb0cd60cf886c768499cae6202aaf1d1 * ADDED: New class file_no_depends(File) to indicate that an imported file exists, but does not resolve any predicates. * PORT: Bug#33: Check for gmp_randinit_mt() This function seems not present before libgmp 4.2.0. Note that this implies that save/restore of the random state is not supported in versions that do not have this function. * DOC: forall/2 after Randy Sharp spotted an issue with the old text. * FIXED: Item#139 from http://www.complang.tuwien.ac.at/ulrich/iso-prolog/conformity_assessment#139. Ulrich Neumerkel. * ENHANCED: Support ~ and multiple solutions in make_library_index/1,2. * FIXED: Option conversion in qsave_program/2. Nicos Angelopoulos. * MODIFIED: Base list_undefined/0,1 on library(prolog_codewalk). * FIXED: Possible crash marking active predicates. This marking is done when reloading a source-file. * ENHANCED: Use a record for reducing option processing overhead * DOC: term_factorized/3. * DOC: A few more edits after Randy's remarks. * ENHANCED: Better error message and continue on directives that set predicates attributes such as dynamic/1. * ENHANCED: Add information about existing definition when - Trying to modify a static procedure (e.g. dynamic after adding clauses) - Redefine a static procedure by loading a new definition from a new file. * MODIFIED: library(prolog_colour) now uses head(Classification, Head) as info for heads, rather than plain head(Classification). This allows for context menus in PceEmacs. * DOC: normal files/module files/included files. * CLEANUP: Use new read_clause/3 in library(prolog_source) * CLEANUP: Introduce read_clause/3, moving read_clause/1,2 to library(backcomp). These changes prepare for reusing the reader and expansion mechanisms for the cross-referencer and other program analysis tools by synchronizing the option processing with library(prolog_source). These changes also simplify option processing in the more time-critical parts of input processing. * ENHANCED: Get module right for colouring an included file. * ADDED: PL_backtrace() to C-API and added some flags to make it more usable. Intended for debugging purposes under a C-debugger. * ADDED: library(prolog_codewalk). This new library is derived from library(prolog_autoload). Future versions of this library will provide additional functionality, such as finding references to predicates, finding unreachable code, etc. * ADDED: day_of_the_year/2. * ENHANCED: When cross-referencing a loaded file, setup the context as it is loaded: the context module and the dialect. * ADDED: Allow for :- expects_dialect(Dialect) before the module header. * MODIFIED: Revert current `source module' to user in library(prolog_source). * ADDED: Process lists of predicate indicators in cross-referencer and for colour support. * ENHANCED: Added some logic to prolog_xref and prolog_colour to nicely colour the SWI-Prolog boot file. * ADDED: Classify predicates that overrides imports * DOC: Some updates and pl --&gt; swipl changes * ADDED: Predicates imported with use_module/1 can be overrided with local definitions. * MODIFIED: Older versions used the imported definition. An attempt to create a local definition resulted in a permission error. In this version, the local definition is used and, depending on the flag =warn_override_implicit_import=, this overriding is announced with a warning (default) or silent. * CLEANUP: Remove type id for record and procedure. Since we use db-refs, these are no longer needed to distinguish them and we no longer need heuristics to tell bogus pointers from real ones. * DOC: format_to_chars/3,4 and format_to_codes/3,4. Jeff Schultz. =============== Package archive =============== * PORT: Windows has no mode_t ============ Package clib ============ * ADDED: delete_directory_contents/1 * ADDED: copy_directory/2 and delete_directory_and_contents/1 to library(filesex). * DOC: Enhanced some comments for library(process). ========== Package db ========== * FIXED: Integrated makefile suite forgot to include -ldb. =========== Package ssl =========== * FIXED: Load SSL certificate when initializing the SSL context. If SSL certificates are loaded during SSL negotiation by HTTPS worker threads then data races may occur ============ Package xpce ============ * FIXED: Keep $aborted exception in the environment, such that quitting Prolog no longer says that 1 thread could not be killed (if xpce is idle). * FIXED: Possible crash posting an event to a non-displayed window. Jochem Liem. * ADDED: PceEmacs: indicate that an imported module does not resolve anything. * ADDED: PceEmacs shows menu of predicates imported from a file. * FIXED: Passing source-identifier for colouring from PceEmacs. Caused misclassification of relative files. * ENHANCED: Make emacs_frame-&gt;confirm open a model centered dialog. * FIXED: Update tab distance in editor-&gt;font * ADDED: PceEmacs C--, C-+ and C-= to change the editor font * FIXED: Show all modifiers in event-viewer * ADDED: PceEmacs -&gt;resize_font * PORT: Support font.scale class variable also for X11 (when using Xft, but this is default). * ADDED: PceEmacs to provide property info on loaded predicates * ENHANCED: XREF the main file for colouring an included file. * ENHANCED: Editing of included files: (1) find the proper module for colouring, (2) when re-compiling the file using C-cC-b, recompile the master file instead of the included file and (3) use make:reload_file/1 to reload the file ============ Package zlib ============ * PORT: Use zlibwapi, also on 32-bit windows * ADDED: Handle multi part gzip streams. Walter Steinhart. </pre> Jan Wielemaker 2012-05-12T14:43:40 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16767 <pre>At present, pure_input takes a seekable stream like a file, but the manual suggests pipe support is planned.  Thinking for myself, if a DCG construct demands a value, it should read from a buffer to get it.  If the buffer is exhausted, it should seek additional input from the stream.  On backtracking, data is already read from the stream and there's no need (or ability) to read again, so we get info from what's already read in.  For my case, I'm not worried about data volume being excessive so I don't care to limit the stream cache.  The only question is that the DCG alone knows how much data to read and when we reached end of input.  So how do we tie these together? Is this about right?  Is there an easier way?  Has anything been started?   Alan Baljeu -------------- next part -------------- HTML attachment scrubbed and removed </pre> Alan Baljeu 2012-05-10T21:51:54 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16765 <pre>[Apologies for multiple receptions] Hello. This is a mail just for informing that the new release Datalog Educational System version 3.0 http://des.sourceforge.net has been launched on May, 10th, 2012, and ported to SWI-Prolog 6.0.2 There are two relevant enhancements in the current release: Predicate persistency supported by external databases, and an extended SQL debugger. The first one motivates raising the major version as it opens a brand new scenario for several reasons: First, predicates are no longer limited by available memory; instead, persisted predicates are using as much secondary storage as needed and provided by the underlying external database. Second, processing is directed to the external database for those rules that can be projected, and to the deductive engine for rules that can not. This way, one can take advantage of the external database performance and scalability. Third, queries which are not possible in an external database can be solved by the deductive engine. So, one can extend external database expressiveness with the added features in DES. Finally, as several ODBC connections are allowed at a time, different predicates can be made persistent in different DMBSs, which allows for interoperability among external relational engines and the local deductive engine, therefore enabling business intelligence applications. With respect to the new SQL Debugger version, which is a new implementation, it also now accept user information about wrong and missing tuples, allowing to focus the questions directed to the user on more precise error sources, therefore preventing many questions involving large sets of data. New ports to SICStus Prolog 4.2.1 and SWI-Prolog 6.0.2 have been provided. Finally, the license has been relaxed to LGPL version 3. A complete list of enhancements, changes and fixed bugs is attached to the end of this message. Please, see http://des.sourceforge.net for details. Best regards. ============================================================= Fernando Saenz Perez Profesor Titular de Universidad / Associate Professor Home Page: http://www.fdi.ucm.es/profesor/fernan Tel: + 34 913947642. Fax: + 34 913947547 Despacho / Office: 435 (4ª planta / 4th floor) Dept. Ingenieria del Software e Inteligencia Artificial / Department of Software Engineering and Artificial Intelligence Universidad Complutense de Madrid Facultad de Informatica C/Profesor Jose Garcia Santesmases, s/n E - 28040 Madrid. Spain ============================================================= Version 3.0 of DES (released on May, 10th, 2012) * Enhancements: o New commands: + /close_db Name Close the given ODBC connection. TAPI enabled + /drop_assertion Drop an assertion + /start_stopwatch Start stopwatch. Precision depends on host Prolog system (1 second or milliseconds) + /stop_stopwatch Stop stopwatch + /reset_stopwatch Reset stopwatch + /display_stopwatch Display stopwatch + /list_persisted Display the persisted predicates. TAPI enabled + /show_dbs Display the open database connections. TAPI enabled + /show_sql Display whether SQL statements which are sent to an external database are to be displayed + /show_sql Switch Enable or disable display of SQL statements which are sent to an external database (on or off, resp.) + /use_db Name Make Name the current ODBC connection. TAPI enabled + /dbschema Connection:Name Display the database schema for the given view or table name in the given connection + /license Display GPL and LGPL licenses. If not found, please visit http://www.gnu.org/licenses o New assertions: + :-persistent(PredSpec[,Connection])) Make a predicate to persist on an external RDBMS via an ODBC connection. PredSpec can be either the pattern PredName/Arity or PredName(Schema), where Schema can be either ArgName1, …, ArgNameN or ArgName1:Type1, …, ArgNameN:TypeN. If a connection name is not provided, the current open database is used o Binary flags in commands are no longer case-sensitive o New port to SICStus Prolog 4.2.1. This release fixes in particular some issues with ODBC connections (exceptions about misencoded string in non-ASCII ODBC messages, and incorrect handling of SQL_BIGINT and related types) o New port to SWI-Prolog 6.0.2 * Changes: o License has been relaxed to GNU Lesser General Public License o New versions of command /debug_sql does not admit a traversing order yet (order option removed) o Release notes of older DES versions are moved to the new document: releasenotesDES.pdf * Fixed bugs: o Some spanned inputs without leading blanks in multi-line mode were not recognised o Duplicated object rules were retrieved several times o Some commands were not recognized in mixed or uppercase o Some listings in development mode did not display all rules o Some hypothetical queries led to exceptions o Existency of table and attributes in an INSERT SQL statement with a SQL data source was not checked o Parsing of a SQL relation separated by a leading space before the comma lead to syntax error o Predefined strong constraints relating a tuple of column names were rejected if its lexicographic order did not match the order in which they occur in table definition o Running info were logged o Some rules with conjunctions and disjunctions were not parsed correctly from consulted files o GNU Prolog source distribution stopped processing of batch files while encountering a /shell command o Predicate dependency graph and strata were not computed after issuing DML SQL statements INSERT, DELETE and DQL SQL statement WITH </pre> fernan< at >sip.ucm.es 2012-05-10T12:55:10 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16764 <pre>I am puzzled a bit with the gcc version that is used for building swipl. I changed the variable CC=gcc-4.4 in the file build but when I then compile swipl, it will anyway use gcc. That is at least what is printed on the terminal during make. Shouldn't the makefile use $(CC) instead gcc? I am using Ubuntu 12.04 (64bit) and gcc-4.4 instead gcc-4.6 because of some incompatibilities with other software. So, if swipl is compiled with gcc-4.6, then I am afraid that I cannot link it to the other software that is compiled with gcc-4.4. Cheers: Manfred </pre> Manfred Jeusfeld 2012-05-10T12:50:50 http://comments.gmane.org/gmane.comp.ai.prolog.swi/16760 <pre>Should I drop PCE emacs for the Eclipse PDT?    Alan Baljeu -------------- next part -------------- HTML attachment scrubbed and removed </pre> Alan Baljeu 2012-05-09T17:02:10 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.ai.prolog.swi