http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1426 <pre> ============================================================ Call for papers 22nd International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2012 http://costa.ls.fi.upm.es/lopstr12 Leuven, Belgium, September 18-20, 2012 (co-located with PPDP 2012) ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 22nd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 20</pre> Jon Sneyers 2012-05-14T11:21:27 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1425 <pre> =============================================================================== SECOND CALL FOR PAPERS ASPOCP 2012 5th Workshop on Answer Set Programming and Other Computing Paradigms http://sites.google.com/site/aspocp12 September 4th, 2012 Collocated with the International Conference on Logic Programming 2012 Budapest, Hungary September 4-8, 2012 =============================================================================== AIMS AND SCOPE Since its introduction in the late 1980s, answer set programming (ASP) has been widely applied to various knowledge-intensive tasks and combinatorial search problems. ASP was found to be closely related to SAT, which has led to a new method of computing answer sets using SAT solvers and techniques adapted from SAT. While this has been the most studied relationship which </pre> aspocp-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org 2012-05-11T11:03:30 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1424 <pre>===================================================================== Call for papers 14th International Symposium on Principles and Practice of Declarative Programming PPDP 2012 Special Issue of Science of Computer Programming (SCP) Leuven, Belgium, September 18-20, 2012 (co-located with LOPSTR 2012) ====================================================================== PPDP 2012 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobili</pre> Jon Sneyers 2012-05-14T11:21:47 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1423 <pre>DEADLINE EXTENSION - ILP 2012 - The 22nd International Conference on Inductive Logic Programming Dubrovnik, Croatia, September 17-19, 2012 --------DEADLINE EXTENSION--------- May 14: Abstracts of long papers due May 18: Long papers due http://ida.felk.cvut.cz/ilp2012 KEY DATES: June 4: Notification for long papers July 3: Short/published papers due July 24: Notification for short/published papers September 17-19: Conference INVITED SPEAKERS: Luc de Raedt: Declarative Modelling for Machine Learning Ben Taskar: Geometry of Diversity and Determinantal Point Processes: Representation, Inference and Learning CALL FOR PAPERS The ILP conference series, started in 1991, is the premier international forum on learning from structured data. Originally focusing on the induction of logic programs, it broadened its scope and attracted a lot of attention and interest in recent years. Authors are invited to submit papers presenting original results on all aspects of learning in logic, multi-relational learning and data</pre> Fabrizio Riguzzi 2012-05-07T17:32:23 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1422 <pre> ========================================================================= Call for Papers Ninth International Workshop on Constraint Handling Rules CHR 2012 http://dtai.cs.kuleuven.be/CHR/CHR2012/ Budapest (Hungary), September 4th, 2012 (co-located with ICLP 2012) ========================================================================= Introduction The CHR 2012 Workshop will be held on September 4th, 2012 in Budapest, Hungary, at the occasion of the 28th International Conference on Logic Programming (ICLP 2010), the premier international venue for presenting research in logic programming. More information on the venue and the co-located conference and workshops can be found on the ICLP website (http://www.cs.bme.hu/iclp2012/). The Constraint Handling Rules (CHR) language has become a major declara- tive specification formalism and implemen</pre> Jon Sneyers 2012-04-27T06:54:23 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1421 <pre>Hi Vitor, It is a while ago that we reported issues with the stable YAP 6.2.3 and this message is to confirm that it really *is* stable! During the past months we ran regression tests producing 540 million lines of N3 data per day and it really works in an excellent way :-) Thanks!! Jos Kind regards, Jos De Roo | Agfa HealthCare Senior Researcher | HE/Advanced Clinical Applications Research http://www.agfa.com/w3c/jdroo http://twitter.com/josderoo Agfa HealthCare NV, Moutstraat 100, B-9000 Gent, Belgium http://www.agfa.com/healthcare ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> jos.deroo-HhcJg5Z4elQ< at >public.gmane.org 2012-04-25T22:44:10 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1420 <pre>===================================================================== Call for papers 14th International Symposium on Principles and Practice of Declarative Programming PPDP 2012 Special Issue of Science of Computer Programming (SCP) Leuven, Belgium, September 18-20, 2012 (co-located with LOPSTR 2012) ====================================================================== PPDP 2012 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, mod</pre> Jon Sneyers 2012-04-25T06:45:59 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1419 <pre>Hi Fabrizio That's a bug of stack expansion in the middle of parsing. The bug should have been fixed now in git. Vitor On Apr 14, 2012, at 5:19 PM, Fabrizio Riguzzi wrote: ------------------------------------------------------------------------------ For Developers, A Lot Can Happen In A Second. Boundary is the first to Know...and Tell You. Monitor Your Applications in Ultra-Fine Resolution. Try it FREE! http://p.sf.net/sfu/Boundary-d2dvs2 </pre> Vítor Santos Costa 2012-04-15T21:42:54 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1418 <pre>Hi Vitor, when loading the file I am sending you (in zipped format), YAP 6.3.1 says % % YAP OOOPS: tried to access illegal address 0xb6fc017c!!!!. % % while Yap 5.1.4 successfully loads the file. Cheers, Fabrizio ------------------------------------------------------------------------------ For Developers, A Lot Can Happen In A Second. Boundary is the first to Know...and Tell You. Monitor Your Applications in Ultra-Fine Resolution. Try it FREE! http://p.sf.net/sfu/Boundary-d2dvs2_______________________________________________ Yap-users mailing list Yap-users-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/yap-users </pre> Fabrizio Riguzzi 2012-04-14T16:19:07 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1417 <pre> ============================================================ Call for papers 22nd International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2012 http://costa.ls.fi.upm.es/lopstr12 Leuven, Belgium, September 18-20, 2012 (co-located with PPDP 2012) ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 22nd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2012) wi</pre> Jon Sneyers 2012-04-11T07:05:43 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1416 <pre>Hi Jason Two other approaches: - you can try using the thread functionality. You configure yap with --enable-threads and fork an extra thread per directory. - you can use the MPI interface, but that might be overkill in this example. Cheers Vitor ------------------------------------------------------------------------------ Better than sec? Nothing is better than sec when it comes to monitoring Big Data applications. Try Boundary one-second resolution app monitoring today. Free. http://p.sf.net/sfu/Boundary-dev2dev </pre> Vítor Santos Costa 2012-04-11T20:35:54 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1415 <pre> Dear Jason, It is is unlikely that this is the most elegant solution, but if you are on linux/mac you can just start a number of (background processes from the command-line. You can either change your source file to have some basic awareness of command line input (eg see argv/1) or start yap with the appropriate -g call. For instance yap -f -l source_file.pl -g goal(dir1) &amp; There is nothing stoping you from running these from within Yap (via shell/1, system/1, process_create/3). Nicos Angelopoulos --- bioinformatics.nki.nl/~nicos On Wed, 11 Apr 2012 14:59:32 +0300 Jason Filippou &lt;jason.filippou-Re5JQEeQqe8AvxtiuMwx3w&lt; at &gt;public.gmane.org&gt; wrote: ------------------------------------------------------------------------------ Better than sec? Nothing is better than sec when it comes to monitoring Big Data applications. Try Boundary one-second resolution app monitoring today. Free. http://p.sf.net/sfu/Boundary-dev2dev </pre> Nicos 2012-04-11T19:12:06 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1414 <pre>Hello list, I have a predicate goal/1 which takes as an argument a directory path. In my code, I have 30 different grounded definitions of goal/1, each with an argument representing a static directory path, like so: goal('directory1'):- doSomethingWithDirectory('directory1'), ..... goal('directory2'):- doSomethingWithDirectory('directory1'), ..... To execute all different grounded definitions of goal/1 without prompting for unification questions, I type in the YAP prompt: ?- findall(X, goal(X), _). But this is still cumbersome, because I have to wait for the job corresponding to directory1 to finish, then move on to directory2, and so on. I'd like to execute the different definitions of goal/1 in parallel to speed up execution. Is there any way to do this through YAP? Thanks, Jason </pre> Jason Filippou 2012-04-11T11:59:32 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1413 <pre> I am just wondering if there is a middle/long term plan to port YAP to Android (or other operative system for mobile systems). I think it should be possible, since at the end Android is executed over a Linux, but I do not think if would be easy for the amount of customizations that google probably added when building the OS (but not sure about that). Sergio </pre> sergioc78 2012-04-08T16:39:12 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1412 <pre> =============================================================================== CALL FOR PAPERS ASPOCP 2012 5th Workshop on Answer Set Programming and Other Computing Paradigms http://sites.google.com/site/aspocp12 September 4th, 2012 Collocated with the International Conference on Logic Programming 2012 Budapest, Hungary September 4-8, 2012 =============================================================================== AIMS AND SCOPE Since its introduction in the late 1980s, answer set programming (ASP) has been widely applied to various knowledge-intensive tasks and combinatorial search problems. ASP was found to be closely related to SAT, which has led to a new method of computing answer sets using SAT solvers and techniques adapted from SAT. While this has been the most studied relationship which is c</pre> aspocp-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org 2012-04-02T17:21:06 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1411 <pre> CALL FOR PARTICIPATION: FLOPS 2012 ================================== Eleventh International Symposium on Functional and Logic Programming May 23-25, 2012 Takikawa Memorial Hall, Kobe University, Kobe, Japan http://www.org.kobe-u.ac.jp/flops2012/ *Early Registration: April 25 (Wed)* FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. The 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) and satellite workshops including WFLP 2012 will be held in the week after FLOPS at Nagoya, Japan. Invited Speakers &lt; at &gt; FLOPS ================ - Tachio Terauchi (Graduate School of Information Science, Nagoya University). Automated Verification of Higher-order Functional Programs - Michael Codish (Department of Computer Science, Ben-Gurion University of the Negev). Programming with</pre> Tom Schrijvers 2012-03-29T12:24:41 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1410 <pre>Hello Vitor, Thanks for your answers and great job on prolog. It took me some times to think about limitations you pointed out, trying to find alternative solution. I understand it is at least possible to have or-parallelism yap working in a shared memory multi processor environment (multi threading I guess). After your first remark, I understand that there is a side-effect issue that makes CHR not ready to use yap implicit or-paralellism, even in a shared memory environment. If my knowledge is correct, it may be because of rules concurrency in the store. Anyway, if I wish to use parallel CHR, yap is not yet the solution, despite of its great performance benefit, as it needs explicit parallelism that should be however integrated into CHR. I am now investigating Martin Sulzmann's CCHR solution, on top of shared memory STM-based Haskell. I even saw a PVM based Glasgow Parallel Haskell &lt;http://www.macs.hw.ac.uk/%7Edsg/gph/&gt;that could be the base for, I hope, a distributed memory CHR solver, alre</pre> Jean-Michel Rioux 2012-03-22T16:02:33 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1409 <pre> Hallo, I try to build yap 6.3.1 on openindiana as a 64 bit app. I got a working yap after solving the problems: 1) C/pl-yap.c doesn't include ieeefp.h but uses macros defined there. The configure correctly detects the presence of ieeefp.h, and defines HAVE_IEEEFP_H in config.h; including the header fixes the problem. 2) os/pl-file.c doesn't include limits.h but uses MB_LEN_MAX macro; including limits.h resolves the problem. 3) os/pl-option.c doesn't include limits.h but uses MAX_LONG macro; including limits.h resolves the problem. 4) packages/clib/maildrop/rfc2045/rfc2045mkboundary.c checks HAS_GETHOSTNAME, but should check HAVE_GETHOSTNAME (the result is a conflicting definition of gethostname) 5) linking dtd2pl: the flag -m64 gets lost somewhere - I've got it in CFLAGS, CXXFLAGS and LDFLAGS which I give to the top level configure script, but the linking of dtd2pl is attempted as: / /usr/bin/gcc -shared -o dtd2pl parser.o util.o charmap.o catalog.o model.o xmlns.o utf8.o xml_unicode.o dt</pre> Michael Figiel 2012-03-25T18:40:41 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1408 <pre>Hi Jean-Michel That's correct! No. There are two problems: yapor only supports side-effects free programs (and chr does stuff to the store) and it only supports shared memory/ The MPI interface has been improved on 6.3.2 (development version in git), but that is explicit parallelism. It's basically a wrapper over the MPI library. There is work going on on adapting yapor to distributed memory, but it is early days. Copying is the one that works. It is possible to do that, my knowledge of chr is that the main problem will be the way it manipulates the store (through nb_setval predicates). Tom is the person to ask, what do you say Tom? Cheers Vitor ------------------------------------------------------------------------------ This SF email is sponsosred by: Try Windows Azure free for 90 days Click Here http://p.sf.net/sfu/sfd2d-msazure </pre> Vítor Santos Costa 2012-03-21T09:09:00 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1407 <pre> I am a student at London South Bank University and is doing a Bsc Project on Prolog. Comparing Free and Commercially available Prolog's to see if the cost of commercially available Prolog software can be justified for commercial development projects: A case study to compare shareware and freeware Prolog to that of commercially available products. I have been collecting facts from different people and I thought this might be a good place to find some more opinions to help me get to my conclusion. Looking at things like the services provided, the speed it works at, intelectual property issues, additional features, cost, support/help provided, interfaces, ease of use, Reputation of the prolog, Does sizes of commercial projects affect Prolog choices, etc. I also want users to please take some time out and answer a short multiple choice questionnaire (8 questions) for me, about Prolog. I want to include the opinions of the users to my conclusion. It will be much appreciated, Thank you in regards. Follow this l</pre> vorsterj 2012-03-20T23:05:50 http://permalink.gmane.org/gmane.comp.ai.prolog.yap.general/1406 <pre>Hello all, My concern is to run a set of CHR constraints in a distributed architecture like AWS multi EC2 instances cluster to gain in performance. I understand Yap compiler implements implicit parallelism called or-parallelism with several possible mechanisms. By implicit parallelism, I understand that it is not necessary to manually schedule parallel execution. Despite all documentation I have found on the web, I am a bit lost because I am very new in parallel computing and just concerned by using it. I have some questions : - is it possible, without changing anything to underlying implementation of CHR/Yap compiler, to run a unique Yap-compiled process in a distributed memory multi instances cluster of multi core servers by distributing execution on all cores as equally as possible and then gain in performance ? - how Yap can be told about cluster architecture to schedule parts of the process between cores and instances ? Would you have more user documentation on this than in manual chapter 17 ? I gu</pre> Jean-Michel Rioux 2012-03-20T14:40:41 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.ai.prolog.yap.general